./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-37.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-37.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 74c5f41427fcd5f7006677941b6f3ff4d210550b7e3610a7968cf5a360f424cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:16:41,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:16:41,246 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:16:41,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:16:41,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:16:41,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:16:41,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:16:41,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:16:41,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:16:41,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:16:41,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:16:41,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:16:41,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:16:41,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:16:41,277 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:16:41,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:16:41,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:16:41,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:16:41,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:16:41,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:16:41,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:16:41,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:16:41,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:16:41,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:16:41,279 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:16:41,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:16:41,279 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:16:41,279 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:16:41,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:16:41,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:16:41,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:16:41,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:16:41,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:41,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:16:41,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:16:41,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:16:41,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:16:41,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:41,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:16:41,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:16:41,280 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:16:41,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:16:41,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:16:41,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:16:41,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:16:41,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:16:41,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:16:41,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:16:41,281 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 -> 74c5f41427fcd5f7006677941b6f3ff4d210550b7e3610a7968cf5a360f424cc [2025-01-09 14:16:41,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:16:41,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:16:41,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:16:41,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:16:41,580 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:16:41,581 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-37.i [2025-01-09 14:16:42,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/387f944bb/8dcdda2a386e447eb190c329977d5cdd/FLAG21094548c [2025-01-09 14:16:43,172 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:16:43,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-37.i [2025-01-09 14:16:43,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/387f944bb/8dcdda2a386e447eb190c329977d5cdd/FLAG21094548c [2025-01-09 14:16:43,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/387f944bb/8dcdda2a386e447eb190c329977d5cdd [2025-01-09 14:16:43,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:16:43,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:16:43,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:16:43,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:16:43,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:16:43,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@618be484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43, skipping insertion in model container [2025-01-09 14:16:43,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:16:43,596 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-37.i[915,928] [2025-01-09 14:16:43,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:16:43,637 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:16:43,646 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-37.i[915,928] [2025-01-09 14:16:43,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:16:43,679 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:16:43,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43 WrapperNode [2025-01-09 14:16:43,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:16:43,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:16:43,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:16:43,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:16:43,686 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:16:43" (1/1) ... [2025-01-09 14:16:43,691 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:16:43" (1/1) ... [2025-01-09 14:16:43,706 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-01-09 14:16:43,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:16:43,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:16:43,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:16:43,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:16:43,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,725 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:16:43,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:16:43,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:16:43,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:16:43,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:16:43,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (1/1) ... [2025-01-09 14:16:43,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:43,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:16:43,770 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:16:43,773 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:16:43,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:16:43,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:16:43,792 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:16:43,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:16:43,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:16:43,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:16:43,847 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:16:43,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:16:43,996 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 14:16:43,996 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:16:44,003 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:16:44,004 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:16:44,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:44 BoogieIcfgContainer [2025-01-09 14:16:44,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:16:44,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:16:44,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:16:44,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:16:44,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:16:43" (1/3) ... [2025-01-09 14:16:44,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1053e816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:16:44, skipping insertion in model container [2025-01-09 14:16:44,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:43" (2/3) ... [2025-01-09 14:16:44,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1053e816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:16:44, skipping insertion in model container [2025-01-09 14:16:44,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:44" (3/3) ... [2025-01-09 14:16:44,013 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-37.i [2025-01-09 14:16:44,026 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:16:44,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-37.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:16:44,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:16:44,098 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;@4d957714, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:16:44,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:16:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:16:44,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 14:16:44,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:44,109 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:44,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:44,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1875107410, now seen corresponding path program 1 times [2025-01-09 14:16:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:16:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753095405] [2025-01-09 14:16:44,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:16:44,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 14:16:44,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 14:16:44,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:44,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 14:16:44,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:16:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753095405] [2025-01-09 14:16:44,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753095405] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:16:44,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934034699] [2025-01-09 14:16:44,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:44,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:16:44,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:16:44,328 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:16:44,329 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:16:44,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 14:16:44,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 14:16:44,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:44,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:44,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:16:44,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 14:16:44,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:16:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934034699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:16:44,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:16:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127992221] [2025-01-09 14:16:44,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:44,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:16:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:16:44,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:16:44,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:16:44,493 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 14:16:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:44,511 INFO L93 Difference]: Finished difference Result 74 states and 116 transitions. [2025-01-09 14:16:44,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:16:44,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2025-01-09 14:16:44,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:44,517 INFO L225 Difference]: With dead ends: 74 [2025-01-09 14:16:44,517 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 14:16:44,520 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:16:44,522 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:16:44,523 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:16:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 14:16:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-09 14:16:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:16:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-01-09 14:16:44,551 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 74 [2025-01-09 14:16:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:44,552 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-01-09 14:16:44,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 14:16:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-01-09 14:16:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 14:16:44,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:44,554 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:44,561 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:16:44,755 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:16:44,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1074057292, now seen corresponding path program 1 times [2025-01-09 14:16:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:16:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963858964] [2025-01-09 14:16:44,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:16:44,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 14:16:44,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 14:16:44,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:44,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 14:16:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:16:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963858964] [2025-01-09 14:16:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963858964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:45,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:16:45,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:16:45,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823168026] [2025-01-09 14:16:45,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:45,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:16:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:16:45,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:16:45,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:16:45,581 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 14:16:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:45,700 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2025-01-09 14:16:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:16:45,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2025-01-09 14:16:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:45,703 INFO L225 Difference]: With dead ends: 56 [2025-01-09 14:16:45,703 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 14:16:45,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:16:45,705 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 27 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:45,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 206 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:16:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 14:16:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-01-09 14:16:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 14:16:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2025-01-09 14:16:45,724 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 74 [2025-01-09 14:16:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:45,724 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2025-01-09 14:16:45,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 14:16:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2025-01-09 14:16:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 14:16:45,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:45,727 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:45,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:16:45,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:45,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash 700950070, now seen corresponding path program 1 times [2025-01-09 14:16:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:16:45,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085926637] [2025-01-09 14:16:45,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:45,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:16:45,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 14:16:45,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 14:16:45,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:45,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:16:45,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:16:45,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 14:16:45,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 14:16:45,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:45,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:16:45,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:16:45,878 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:16:45,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:16:45,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:16:45,884 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:16:45,934 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:16:45,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:16:45 BoogieIcfgContainer [2025-01-09 14:16:45,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:16:45,938 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:16:45,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:16:45,938 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:16:45,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:44" (3/4) ... [2025-01-09 14:16:45,940 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:16:45,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:16:45,942 INFO L158 Benchmark]: Toolchain (without parser) took 2466.36ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 88.4MB in the end (delta: 66.5MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2025-01-09 14:16:45,942 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:45,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.29ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 142.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:45,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.13ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 141.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:45,943 INFO L158 Benchmark]: Boogie Preprocessor took 30.66ms. Allocated memory is still 201.3MB. Free memory was 141.3MB in the beginning and 140.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:45,943 INFO L158 Benchmark]: RCFGBuilder took 266.50ms. Allocated memory is still 201.3MB. Free memory was 140.0MB in the beginning and 127.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:45,945 INFO L158 Benchmark]: TraceAbstraction took 1930.61ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 89.6MB in the end (delta: 37.2MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:45,945 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 201.3MB. Free memory was 89.6MB in the beginning and 88.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:45,947 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.27ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.29ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 142.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.13ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 141.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.66ms. Allocated memory is still 201.3MB. Free memory was 141.3MB in the beginning and 140.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 266.50ms. Allocated memory is still 201.3MB. Free memory was 140.0MB in the beginning and 127.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1930.61ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 89.6MB in the end (delta: 37.2MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 201.3MB. Free memory was 89.6MB in the beginning and 88.4MB in the end (delta: 1.1MB). 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 someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -25; [L23] double var_1_2 = 0.19999999999999996; [L24] double var_1_3 = 9.4; [L25] signed long int var_1_4 = 50; [L26] unsigned long int var_1_5 = 32; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 1; [L29] double var_1_8 = 9.75; [L30] double var_1_9 = 49.8; VAL [isInitial=0, var_1_1=-25, var_1_2=4999999999999999/25000000000000000, var_1_3=47/5, var_1_4=50, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L75] isInitial = 1 [L76] FCALL initially() [L78] FCALL updateLastVariables() [L79] CALL updateVariables() [L49] var_1_2 = __VERIFIER_nondet_double() [L50] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_3=47/5, var_1_4=50, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_3=47/5, var_1_4=50, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L50] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-25, var_1_3=47/5, var_1_4=50, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L51] var_1_3 = __VERIFIER_nondet_double() [L52] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=50, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=50, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L52] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-25, var_1_4=50, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L53] var_1_4 = __VERIFIER_nondet_long() [L54] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L54] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L55] CALL assume_abort_if_not(var_1_4 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L55] RET assume_abort_if_not(var_1_4 <= 2147483646) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=1, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L56] var_1_6 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L57] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L58] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L58] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=1, var_1_8=39/4, var_1_9=249/5] [L59] var_1_7 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_8=39/4, var_1_9=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_8=39/4, var_1_9=249/5] [L60] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_8=39/4, var_1_9=249/5] [L61] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0, var_1_8=39/4, var_1_9=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0, var_1_8=39/4, var_1_9=249/5] [L61] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0, var_1_8=39/4, var_1_9=249/5] [L62] var_1_8 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0, var_1_9=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0, var_1_9=249/5] [L63] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0, var_1_9=249/5] [L64] CALL assume_abort_if_not(var_1_8 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0, var_1_9=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0, var_1_9=249/5] [L64] RET assume_abort_if_not(var_1_8 != 0.0F) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0, var_1_9=249/5] [L65] var_1_9 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0] [L66] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0] [L79] RET updateVariables() [L80] CALL step() [L34] COND FALSE !(var_1_2 < var_1_3) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0] [L37] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=-255, var_1_1=-25, var_1_4=2147483646, var_1_5=32, var_1_6=-255, var_1_7=0] [L38] COND FALSE !(stepLocal_0 && var_1_7) [L45] var_1_5 = var_1_4 VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=2147483646, var_1_6=-255, var_1_7=0] [L80] RET step() [L81] CALL, EXPR property() [L71-L72] return ((var_1_2 < var_1_3) ? (var_1_1 == ((signed long int) (2 - var_1_4))) : 1) && ((var_1_6 && var_1_7) ? ((var_1_3 < ((var_1_2 / var_1_8) + var_1_9)) ? (var_1_5 == ((unsigned long int) var_1_4)) : (var_1_5 == ((unsigned long int) var_1_4))) : (var_1_5 == ((unsigned long int) var_1_4))) ; VAL [\result=0, isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=2147483646, var_1_6=-255, var_1_7=0] [L81] RET, EXPR property() [L81] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=2147483646, var_1_6=-255, var_1_7=0] [L19] reach_error() VAL [isInitial=1, var_1_1=-25, var_1_4=2147483646, var_1_5=2147483646, var_1_6=-255, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 105 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 640/660 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:16:45,968 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-37.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 74c5f41427fcd5f7006677941b6f3ff4d210550b7e3610a7968cf5a360f424cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:16:48,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:16:48,294 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:16:48,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:16:48,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:16:48,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:16:48,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:16:48,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:16:48,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:16:48,333 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:16:48,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:16:48,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:16:48,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:16:48,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:16:48,338 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:16:48,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:16:48,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:16:48,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:16:48,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:16:48,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:16:48,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:16:48,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:16:48,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:16:48,339 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:16:48,339 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:16:48,340 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:16:48,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:16:48,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:16:48,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:16:48,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:16:48,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:16:48,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:16:48,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:16:48,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:16:48,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:48,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:16:48,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:16:48,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:16:48,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:16:48,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:48,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:16:48,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:16:48,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:16:48,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:16:48,342 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:16:48,342 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:16:48,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:16:48,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:16:48,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:16:48,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:16:48,343 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 -> 74c5f41427fcd5f7006677941b6f3ff4d210550b7e3610a7968cf5a360f424cc [2025-01-09 14:16:48,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:16:48,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:16:48,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:16:48,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:16:48,668 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:16:48,669 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-37.i [2025-01-09 14:16:49,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95bf28e0f/5a38e6a70d754ce3b21dcfb8e786f276/FLAG80b71e751 [2025-01-09 14:16:50,167 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:16:50,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-37.i [2025-01-09 14:16:50,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95bf28e0f/5a38e6a70d754ce3b21dcfb8e786f276/FLAG80b71e751 [2025-01-09 14:16:50,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95bf28e0f/5a38e6a70d754ce3b21dcfb8e786f276 [2025-01-09 14:16:50,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:16:50,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:16:50,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:16:50,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:16:50,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:16:50,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d88f240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50, skipping insertion in model container [2025-01-09 14:16:50,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:16:50,364 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-37.i[915,928] [2025-01-09 14:16:50,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:16:50,422 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:16:50,433 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-37.i[915,928] [2025-01-09 14:16:50,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:16:50,471 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:16:50,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50 WrapperNode [2025-01-09 14:16:50,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:16:50,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:16:50,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:16:50,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:16:50,481 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:16:50" (1/1) ... [2025-01-09 14:16:50,495 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:16:50" (1/1) ... [2025-01-09 14:16:50,519 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2025-01-09 14:16:50,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:16:50,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:16:50,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:16:50,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:16:50,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,544 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:16:50,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:16:50,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:16:50,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:16:50,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:16:50,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (1/1) ... [2025-01-09 14:16:50,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:50,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:16:50,603 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:16:50,609 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:16:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:16:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:16:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:16:50,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:16:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:16:50,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:16:50,703 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:16:50,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:16:59,143 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 14:16:59,143 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:16:59,152 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:16:59,153 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:16:59,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:59 BoogieIcfgContainer [2025-01-09 14:16:59,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:16:59,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:16:59,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:16:59,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:16:59,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:16:50" (1/3) ... [2025-01-09 14:16:59,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522df5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:16:59, skipping insertion in model container [2025-01-09 14:16:59,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:50" (2/3) ... [2025-01-09 14:16:59,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522df5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:16:59, skipping insertion in model container [2025-01-09 14:16:59,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:59" (3/3) ... [2025-01-09 14:16:59,163 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-37.i [2025-01-09 14:16:59,176 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:16:59,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-37.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:16:59,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:16:59,260 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;@707833c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:16:59,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:16:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:16:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 14:16:59,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:59,276 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:59,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:59,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1875107410, now seen corresponding path program 1 times [2025-01-09 14:16:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:59,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947873698] [2025-01-09 14:16:59,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:59,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:59,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:16:59,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 14:16:59,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 14:16:59,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 14:16:59,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:59,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:59,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:16:59,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 14:16:59,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:16:59,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947873698] [2025-01-09 14:16:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947873698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:59,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:16:59,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:16:59,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163597833] [2025-01-09 14:16:59,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:59,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:16:59,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:59,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:16:59,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:16:59,566 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 14:16:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:59,584 INFO L93 Difference]: Finished difference Result 74 states and 116 transitions. [2025-01-09 14:16:59,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:16:59,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2025-01-09 14:16:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:59,592 INFO L225 Difference]: With dead ends: 74 [2025-01-09 14:16:59,592 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 14:16:59,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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:16:59,597 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:16:59,597 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:16:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 14:16:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-09 14:16:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:16:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-01-09 14:16:59,631 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 74 [2025-01-09 14:16:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:59,633 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-01-09 14:16:59,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 14:16:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-01-09 14:16:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 14:16:59,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:59,638 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:59,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 14:16:59,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:59,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:59,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:59,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1074057292, now seen corresponding path program 1 times [2025-01-09 14:16:59,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:59,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100943563] [2025-01-09 14:16:59,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:59,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:59,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:59,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:16:59,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 14:16:59,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 14:16:59,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 14:16:59,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:59,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:59,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:16:59,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:17:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 14:17:00,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:17:00,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:17:00,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100943563] [2025-01-09 14:17:00,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100943563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:17:00,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:17:00,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:17:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744328077] [2025-01-09 14:17:00,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:17:00,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:17:00,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:17:00,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:17:00,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:17:00,509 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 14:17:04,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:08,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:12,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:17,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:21,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:25,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:29,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:33,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:37,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:41,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:17:42,073 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2025-01-09 14:17:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:17:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2025-01-09 14:17:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:17:42,075 INFO L225 Difference]: With dead ends: 56 [2025-01-09 14:17:42,075 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 14:17:42,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:17:42,076 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:17:42,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 251 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 10 Unknown, 0 Unchecked, 41.3s Time] [2025-01-09 14:17:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 14:17:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-01-09 14:17:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 14:17:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2025-01-09 14:17:42,093 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 74 [2025-01-09 14:17:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:17:42,094 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2025-01-09 14:17:42,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 14:17:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2025-01-09 14:17:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 14:17:42,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:17:42,098 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:42,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 14:17:42,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:17:42,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:17:42,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:17:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash 700950070, now seen corresponding path program 1 times [2025-01-09 14:17:42,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:17:42,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897780032] [2025-01-09 14:17:42,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:17:42,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:17:42,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:17:42,301 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:17:42,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 14:17:42,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 14:17:42,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 14:17:42,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:17:42,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:17:42,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:17:42,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:17:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 14:17:42,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:17:42,925 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:17:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897780032] [2025-01-09 14:17:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897780032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:17:42,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:17:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:17:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293773007] [2025-01-09 14:17:42,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:17:42,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:17:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:17:42,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:17:42,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:17:42,926 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 14:17:47,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:51,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:55,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:17:59,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:18:01,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:18:05,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:18:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:18:06,895 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2025-01-09 14:18:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:18:06,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2025-01-09 14:18:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:18:06,898 INFO L225 Difference]: With dead ends: 55 [2025-01-09 14:18:06,898 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 14:18:06,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:18:06,899 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 13 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:18:06,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 196 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 23.7s Time] [2025-01-09 14:18:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 14:18:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 14:18:06,900 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:18:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 14:18:06,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2025-01-09 14:18:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:18:06,903 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 14:18:06,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 14:18:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 14:18:06,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 14:18:06,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:18:06,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 14:18:07,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:18:07,111 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:18:07,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 14:18:07,236 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:18:07,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:18:07 BoogieIcfgContainer [2025-01-09 14:18:07,249 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:18:07,252 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:18:07,252 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:18:07,252 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:18:07,253 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:59" (3/4) ... [2025-01-09 14:18:07,255 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 14:18:07,260 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 14:18:07,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 14:18:07,266 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 14:18:07,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 14:18:07,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 14:18:07,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 14:18:07,342 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 14:18:07,342 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:18:07,343 INFO L158 Benchmark]: Toolchain (without parser) took 77142.36ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 35.7MB in the end (delta: 23.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2025-01-09 14:18:07,343 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 62.8MB in the beginning and 62.7MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:07,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.90ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 47.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:07,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.18ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 45.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:07,344 INFO L158 Benchmark]: Boogie Preprocessor took 49.04ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 43.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:07,344 INFO L158 Benchmark]: RCFGBuilder took 8583.53ms. Allocated memory is still 83.9MB. Free memory was 43.7MB in the beginning and 31.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:07,345 INFO L158 Benchmark]: TraceAbstraction took 68094.06ms. Allocated memory is still 83.9MB. Free memory was 30.4MB in the beginning and 41.5MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:07,345 INFO L158 Benchmark]: Witness Printer took 90.06ms. Allocated memory is still 83.9MB. Free memory was 41.5MB in the beginning and 35.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:07,346 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.21ms. Allocated memory is still 83.9MB. Free memory was 62.8MB in the beginning and 62.7MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.90ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 47.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.18ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 45.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.04ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 43.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 8583.53ms. Allocated memory is still 83.9MB. Free memory was 43.7MB in the beginning and 31.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 68094.06ms. Allocated memory is still 83.9MB. Free memory was 30.4MB in the beginning and 41.5MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 90.06ms. Allocated memory is still 83.9MB. Free memory was 41.5MB in the beginning and 35.7MB in the end (delta: 5.8MB). 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.9s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 65.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 65.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 497 SdHoareTripleChecker+Invalid, 64.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 336 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 161 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 259 SizeOfPredicates, 10 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 660/660 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:18:07,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE