./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-16.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-16.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 0f3c671fd90b32c42295a3fff7f6ed38c1953794fa7bfd867d0ac70cf5a873bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:15:37,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:15:37,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:15:37,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:15:37,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:15:37,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:15:37,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:15:37,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:15:37,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:15:37,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:15:37,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:15:37,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:15:37,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:15:37,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:15:37,915 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:15:37,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:15:37,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:15:37,915 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:15:37,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:15:37,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:15:37,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:15:37,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:15:37,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:15:37,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:15:37,916 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:15:37,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:15:37,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:15:37,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:15:37,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:15:37,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:15:37,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:15:37,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:15:37,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:37,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:15:37,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:15:37,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:15:37,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:15:37,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:37,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:15:37,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:15:37,917 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:15:37,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:15:37,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:15:37,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:15:37,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:15:37,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:15:37,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:15:37,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:15:37,918 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 -> 0f3c671fd90b32c42295a3fff7f6ed38c1953794fa7bfd867d0ac70cf5a873bc [2025-01-09 14:15:38,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:15:38,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:15:38,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:15:38,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:15:38,126 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:15:38,126 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-16.i [2025-01-09 14:15:39,278 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87a8d1d91/82587bf6a05747ea81ce46cbefbe399e/FLAGf4399ec57 [2025-01-09 14:15:39,499 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:15:39,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-16.i [2025-01-09 14:15:39,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87a8d1d91/82587bf6a05747ea81ce46cbefbe399e/FLAGf4399ec57 [2025-01-09 14:15:39,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87a8d1d91/82587bf6a05747ea81ce46cbefbe399e [2025-01-09 14:15:39,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:15:39,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:15:39,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:15:39,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:15:39,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:15:39,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7858b86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39, skipping insertion in model container [2025-01-09 14:15:39,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:15:39,606 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-16.i[915,928] [2025-01-09 14:15:39,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:15:39,625 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:15:39,631 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-16.i[915,928] [2025-01-09 14:15:39,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:15:39,648 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:15:39,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39 WrapperNode [2025-01-09 14:15:39,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:15:39,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:15:39,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:15:39,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:15:39,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,669 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 63 [2025-01-09 14:15:39,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:15:39,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:15:39,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:15:39,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:15:39,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,687 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:15:39,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:15:39,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:15:39,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:15:39,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:15:39,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:39,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:39,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:15:39,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:15:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:15:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:15:39,738 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:15:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:15:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:15:39,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:15:39,775 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:15:39,776 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:15:39,909 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 14:15:39,910 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:15:39,918 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:15:39,918 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:15:39,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:39 BoogieIcfgContainer [2025-01-09 14:15:39,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:15:39,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:15:39,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:15:39,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:15:39,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:15:39" (1/3) ... [2025-01-09 14:15:39,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2912f054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:15:39, skipping insertion in model container [2025-01-09 14:15:39,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39" (2/3) ... [2025-01-09 14:15:39,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2912f054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:15:39, skipping insertion in model container [2025-01-09 14:15:39,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:39" (3/3) ... [2025-01-09 14:15:39,930 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-16.i [2025-01-09 14:15:39,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:15:39,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-16.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:15:39,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:15:39,997 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;@52ecbb36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:15:39,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:15:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 14:15:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 14:15:40,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:40,007 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:15:40,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:40,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash 637584688, now seen corresponding path program 1 times [2025-01-09 14:15:40,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:40,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734851286] [2025-01-09 14:15:40,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:40,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:40,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 14:15:40,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 14:15:40,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:40,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 14:15:40,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:15:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734851286] [2025-01-09 14:15:40,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734851286] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:15:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424121315] [2025-01-09 14:15:40,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:40,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:40,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:40,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:15:40,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:15:40,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 14:15:40,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 14:15:40,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:40,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:40,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:15:40,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 14:15:40,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:15:40,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424121315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:40,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:15:40,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:15:40,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269365884] [2025-01-09 14:15:40,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:40,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:15:40,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:15:40,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:15:40,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:15:40,278 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 14:15:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:40,292 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-01-09 14:15:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:15:40,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2025-01-09 14:15:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:40,296 INFO L225 Difference]: With dead ends: 56 [2025-01-09 14:15:40,297 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 14:15:40,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:15:40,301 INFO L435 NwaCegarLoop]: 35 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, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:40,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:15:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 14:15:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 14:15:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 14:15:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-01-09 14:15:40,324 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 50 [2025-01-09 14:15:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:40,325 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-01-09 14:15:40,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 14:15:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-01-09 14:15:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 14:15:40,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:40,327 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:15:40,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:15:40,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:15:40,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:40,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash -82573778, now seen corresponding path program 1 times [2025-01-09 14:15:40,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:40,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763546550] [2025-01-09 14:15:40,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:40,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 14:15:40,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 14:15:40,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:40,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:15:40,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:15:40,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 14:15:40,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 14:15:40,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:40,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:15:40,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:15:40,667 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:15:40,668 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:15:40,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:15:40,673 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 14:15:40,710 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:15:40,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:15:40 BoogieIcfgContainer [2025-01-09 14:15:40,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:15:40,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:15:40,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:15:40,716 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:15:40,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:39" (3/4) ... [2025-01-09 14:15:40,719 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:15:40,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:15:40,721 INFO L158 Benchmark]: Toolchain (without parser) took 1199.77ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 71.4MB in the end (delta: 63.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 14:15:40,721 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:15:40,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 128.04ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 123.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:40,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.84ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 122.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:15:40,722 INFO L158 Benchmark]: Boogie Preprocessor took 24.91ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 120.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:40,722 INFO L158 Benchmark]: RCFGBuilder took 224.48ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 108.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:40,723 INFO L158 Benchmark]: TraceAbstraction took 791.93ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 71.4MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 14:15:40,723 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 167.8MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:15:40,724 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.32ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 128.04ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 123.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.84ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 122.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.91ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 120.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 224.48ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 108.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 791.93ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 71.4MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 167.8MB. Free memory is still 71.4MB. 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 someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.45; [L23] unsigned long int var_1_2 = 3925393104; [L24] unsigned long int var_1_3 = 256; [L25] unsigned long int var_1_4 = 2; [L26] float var_1_5 = 3.6; [L27] float var_1_6 = 99.372; [L28] double var_1_7 = 32.15; VAL [isInitial=0, var_1_1=1269/20, var_1_2=3925393104, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L61] isInitial = 1 [L62] FCALL initially() [L64] FCALL updateLastVariables() [L65] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_ulong() [L43] CALL assume_abort_if_not(var_1_2 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L43] RET assume_abort_if_not(var_1_2 >= 2147483647) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L44] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L44] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L45] var_1_3 = __VERIFIER_nondet_ulong() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L47] CALL assume_abort_if_not(var_1_3 <= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L47] RET assume_abort_if_not(var_1_3 <= 1073741824) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L48] var_1_4 = __VERIFIER_nondet_ulong() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L50] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L50] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L51] var_1_5 = __VERIFIER_nondet_float() [L52] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_6=24843/250, var_1_7=643/20] [L52] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_6=24843/250, var_1_7=643/20] [L65] RET updateVariables() [L66] CALL step() [L32] unsigned long int stepLocal_0 = 10u / 16u; VAL [isInitial=1, stepLocal_0=0, var_1_1=1269/20, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_6=24843/250, var_1_7=643/20] [L33] COND TRUE (var_1_2 - (var_1_3 + var_1_4)) <= stepLocal_0 [L34] var_1_1 = var_1_5 VAL [isInitial=1, var_1_1=5368709125, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_5=5368709125, var_1_6=24843/250, var_1_7=643/20] [L38] var_1_6 = var_1_5 [L39] var_1_7 = var_1_5 VAL [isInitial=1, var_1_1=5368709125, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_5=5368709125, var_1_6=5368709125, var_1_7=5368709125] [L66] RET step() [L67] CALL, EXPR property() [L57-L58] return ((((var_1_2 - (var_1_3 + var_1_4)) <= (10u / 16u)) ? (var_1_1 == ((float) var_1_5)) : (var_1_1 == ((float) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && (var_1_6 == ((float) var_1_5))) && (var_1_7 == ((double) var_1_5)) ; VAL [\result=0, isInitial=1, var_1_1=5368709125, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_5=5368709125, var_1_6=5368709125, var_1_7=5368709125] [L67] RET, EXPR property() [L67] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=5368709125, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_5=5368709125, var_1_6=5368709125, var_1_7=5368709125] [L19] reach_error() VAL [isInitial=1, var_1_1=5368709125, var_1_2=-9223372030412324865, var_1_3=5368709120, var_1_4=-3221225473, var_1_5=5368709125, var_1_6=5368709125, var_1_7=5368709125] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 35 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 98 SizeOfPredicates, 0 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 156/168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 14:15:40,741 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 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-16.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 0f3c671fd90b32c42295a3fff7f6ed38c1953794fa7bfd867d0ac70cf5a873bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:15:42,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:15:42,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:15:42,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:15:42,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:15:42,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:15:42,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:15:42,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:15:42,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:15:42,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:15:42,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:15:42,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:15:42,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:15:42,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:42,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:15:42,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:42,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:15:42,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:15:42,679 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:15:42,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:15:42,679 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:15:42,679 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:15:42,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:15:42,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:15:42,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:15:42,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:15:42,680 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 -> 0f3c671fd90b32c42295a3fff7f6ed38c1953794fa7bfd867d0ac70cf5a873bc [2025-01-09 14:15:42,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:15:42,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:15:42,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:15:42,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:15:42,939 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:15:42,940 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-16.i [2025-01-09 14:15:44,180 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d312a272/2113d9a428174579b02fb07ddd505162/FLAG6680e4610 [2025-01-09 14:15:44,378 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:15:44,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-16.i [2025-01-09 14:15:44,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d312a272/2113d9a428174579b02fb07ddd505162/FLAG6680e4610 [2025-01-09 14:15:44,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d312a272/2113d9a428174579b02fb07ddd505162 [2025-01-09 14:15:44,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:15:44,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:15:44,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:15:44,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:15:44,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:15:44,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:44,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5865e063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44, skipping insertion in model container [2025-01-09 14:15:44,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:44,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:15:44,874 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-16.i[915,928] [2025-01-09 14:15:44,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:15:44,917 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:15:44,926 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-16.i[915,928] [2025-01-09 14:15:44,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:15:44,950 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:15:44,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44 WrapperNode [2025-01-09 14:15:44,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:15:44,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:15:44,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:15:44,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:15:44,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:44,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:44,980 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 63 [2025-01-09 14:15:44,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:15:44,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:15:44,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:15:44,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:15:44,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:44,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:44,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:45,006 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:15:45,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:45,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:45,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:45,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:45,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:45,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:45,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:45,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:15:45,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:15:45,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:15:45,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:15:45,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (1/1) ... [2025-01-09 14:15:45,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:45,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:45,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:15:45,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:15:45,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:15:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:15:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:15:45,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:15:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:15:45,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:15:45,111 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:15:45,116 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:15:45,248 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 14:15:45,248 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:15:45,254 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:15:45,254 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:15:45,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:45 BoogieIcfgContainer [2025-01-09 14:15:45,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:15:45,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:15:45,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:15:45,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:15:45,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:15:44" (1/3) ... [2025-01-09 14:15:45,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f5939c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:15:45, skipping insertion in model container [2025-01-09 14:15:45,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:44" (2/3) ... [2025-01-09 14:15:45,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f5939c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:15:45, skipping insertion in model container [2025-01-09 14:15:45,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:45" (3/3) ... [2025-01-09 14:15:45,261 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-16.i [2025-01-09 14:15:45,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:15:45,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-16.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:15:45,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:15:45,317 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;@373458d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:15:45,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:15:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 14:15:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 14:15:45,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:45,327 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:15:45,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:45,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash 637584688, now seen corresponding path program 1 times [2025-01-09 14:15:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:15:45,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181037373] [2025-01-09 14:15:45,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:45,340 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:15:45,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:15:45,343 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:15:45,345 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:15:45,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 14:15:45,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 14:15:45,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:45,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:45,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:15:45,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 14:15:45,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:15:45,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:15:45,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181037373] [2025-01-09 14:15:45,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181037373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:45,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:15:45,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:15:45,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013114944] [2025-01-09 14:15:45,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:45,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:15:45,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:15:45,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:15:45,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:15:45,529 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 14:15:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:45,560 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-01-09 14:15:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:15:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2025-01-09 14:15:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:45,566 INFO L225 Difference]: With dead ends: 56 [2025-01-09 14:15:45,566 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 14:15:45,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:15:45,571 INFO L435 NwaCegarLoop]: 35 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, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:45,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:15:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 14:15:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 14:15:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 14:15:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-01-09 14:15:45,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 50 [2025-01-09 14:15:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:45,601 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-01-09 14:15:45,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 14:15:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-01-09 14:15:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 14:15:45,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:45,604 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:15:45,610 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 14:15:45,808 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:15:45,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:45,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -82573778, now seen corresponding path program 1 times [2025-01-09 14:15:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:15:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696300709] [2025-01-09 14:15:45,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:45,810 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:15:45,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:15:45,815 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:15:45,816 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:15:45,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 14:15:45,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 14:15:45,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:45,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:45,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 14:15:45,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 14:15:49,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:15:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 14:15:52,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:15:52,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696300709] [2025-01-09 14:15:52,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696300709] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 14:15:52,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:15:52,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2025-01-09 14:15:52,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449279074] [2025-01-09 14:15:52,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:52,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:15:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:15:52,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:15:52,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:15:52,232 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 14:15:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:54,506 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-01-09 14:15:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:15:54,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 50 [2025-01-09 14:15:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:54,509 INFO L225 Difference]: With dead ends: 48 [2025-01-09 14:15:54,509 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 14:15:54,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2025-01-09 14:15:54,511 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:54,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 121 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:15:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 14:15:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-01-09 14:15:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:15:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-01-09 14:15:54,519 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 50 [2025-01-09 14:15:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:54,523 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-01-09 14:15:54,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 14:15:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-01-09 14:15:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 14:15:54,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:54,524 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:15:54,530 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 14:15:54,725 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:15:54,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:54,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash -25315476, now seen corresponding path program 1 times [2025-01-09 14:15:54,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:15:54,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896965093] [2025-01-09 14:15:54,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:54,728 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:15:54,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:15:54,732 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:15:54,733 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:15:54,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 14:15:54,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 14:15:54,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:54,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:54,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 14:15:54,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 14:15:57,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:16:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 14:16:00,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:00,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896965093] [2025-01-09 14:16:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896965093] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 14:16:00,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:16:00,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 26 [2025-01-09 14:16:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423933682] [2025-01-09 14:16:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:00,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:16:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:00,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:16:00,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2025-01-09 14:16:00,390 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 14:16:01,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:01,637 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-01-09 14:16:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:16:01,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 50 [2025-01-09 14:16:01,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:01,638 INFO L225 Difference]: With dead ends: 54 [2025-01-09 14:16:01,638 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 14:16:01,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:16:01,642 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:01,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 100 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:16:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 14:16:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 14:16:01,642 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:16:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 14:16:01,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2025-01-09 14:16:01,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:01,643 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 14:16:01,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 14:16:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 14:16:01,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 14:16:01,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:16:01,652 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 14:16:01,846 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:16:01,850 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:16:01,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 14:16:02,329 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:16:02,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2025-01-09 14:16:02,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:16:02 BoogieIcfgContainer [2025-01-09 14:16:02,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:16:02,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:16:02,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:16:02,342 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:16:02,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:45" (3/4) ... [2025-01-09 14:16:02,344 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 14:16:02,349 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 14:16:02,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 14:16:02,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 14:16:02,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 14:16:02,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 14:16:02,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 14:16:02,404 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 14:16:02,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:16:02,405 INFO L158 Benchmark]: Toolchain (without parser) took 17650.11ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 92.2MB in the beginning and 78.7MB in the end (delta: 13.5MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2025-01-09 14:16:02,405 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:02,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.87ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.9MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:02,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.91ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 78.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:02,406 INFO L158 Benchmark]: Boogie Preprocessor took 48.45ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 77.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:02,406 INFO L158 Benchmark]: RCFGBuilder took 222.35ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 65.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:02,407 INFO L158 Benchmark]: TraceAbstraction took 17083.98ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 65.1MB in the beginning and 85.1MB in the end (delta: -19.9MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-01-09 14:16:02,407 INFO L158 Benchmark]: Witness Printer took 61.77ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 78.7MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:02,408 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.3MB in the beginning and 62.3MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.87ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.9MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.91ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 78.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.45ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 77.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 222.35ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 65.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17083.98ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 65.1MB in the beginning and 85.1MB in the end (delta: -19.9MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 61.77ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 78.7MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 * 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 246 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 96 mSDtfsCounter, 246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=2, InterpolantAutomatonStates: 22, 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 1691 SizeOfPredicates, 19 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 396/420 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:16:02,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE