./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:18:40,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:18:40,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:18:40,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:18:40,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:18:40,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:18:40,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:18:40,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:18:40,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:18:40,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:18:40,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:18:40,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:18:40,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:18:40,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:40,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:18:40,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:18:40,912 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/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 -> f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 [2025-03-08 14:18:41,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:18:41,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:18:41,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:18:41,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:18:41,119 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:18:41,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-08 14:18:42,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4969310d3/b570b7d40f4844308477a80b683d9e8a/FLAG7a62c687f [2025-03-08 14:18:42,455 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:18:42,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-08 14:18:42,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4969310d3/b570b7d40f4844308477a80b683d9e8a/FLAG7a62c687f [2025-03-08 14:18:42,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4969310d3/b570b7d40f4844308477a80b683d9e8a [2025-03-08 14:18:42,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:18:42,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:18:42,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:42,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:18:42,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:18:42,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ebf13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42, skipping insertion in model container [2025-03-08 14:18:42,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:18:42,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-03-08 14:18:42,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:42,922 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:18:42,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-03-08 14:18:42,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:42,948 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:18:42,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42 WrapperNode [2025-03-08 14:18:42,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:42,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:42,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:18:42,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:18:42,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,969 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-08 14:18:42,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:42,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:18:42,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:18:42,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:18:42,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,983 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-03-08 14:18:42,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,987 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:18:42,990 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:18:42,990 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:18:42,990 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:18:42,991 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (1/1) ... [2025-03-08 14:18:42,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:43,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:18:43,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:18:43,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:18:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:18:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:18:43,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:18:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:18:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:18:43,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:18:43,076 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:18:43,078 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:18:43,208 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-08 14:18:43,209 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:18:43,214 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:18:43,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:18:43,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:43 BoogieIcfgContainer [2025-03-08 14:18:43,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:18:43,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:18:43,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:18:43,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:18:43,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:18:42" (1/3) ... [2025-03-08 14:18:43,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e2e0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:43, skipping insertion in model container [2025-03-08 14:18:43,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:42" (2/3) ... [2025-03-08 14:18:43,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e2e0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:43, skipping insertion in model container [2025-03-08 14:18:43,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:43" (3/3) ... [2025-03-08 14:18:43,220 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-08 14:18:43,229 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:18:43,230 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:18:43,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:18:43,274 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;@2bc3df2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:18:43,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:18:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 14:18:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 14:18:43,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:43,282 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-03-08 14:18:43,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:43,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:43,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1840070575, now seen corresponding path program 1 times [2025-03-08 14:18:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:18:43,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354309228] [2025-03-08 14:18:43,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:18:43,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 14:18:43,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 14:18:43,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:43,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 14:18:43,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:18:43,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354309228] [2025-03-08 14:18:43,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354309228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:18:43,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199138858] [2025-03-08 14:18:43,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:43,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:18:43,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:18:43,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:18:43,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:18:43,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 14:18:43,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 14:18:43,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:43,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:43,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:18:43,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 14:18:43,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:18:43,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199138858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:18:43,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:18:43,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:18:43,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553061361] [2025-03-08 14:18:43,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:18:43,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:18:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:18:43,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:18:43,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:18:43,521 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 14:18:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:18:43,532 INFO L93 Difference]: Finished difference Result 67 states and 99 transitions. [2025-03-08 14:18:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:18:43,533 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-03-08 14:18:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:18:43,536 INFO L225 Difference]: With dead ends: 67 [2025-03-08 14:18:43,536 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 14:18:43,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-03-08 14:18:43,540 INFO L435 NwaCegarLoop]: 46 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, 46 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-03-08 14:18:43,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:18:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 14:18:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 14:18:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 14:18:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2025-03-08 14:18:43,561 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 49 [2025-03-08 14:18:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:18:43,562 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-03-08 14:18:43,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 14:18:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2025-03-08 14:18:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 14:18:43,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:43,563 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-03-08 14:18:43,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:18:43,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:18:43,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:43,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -570374701, now seen corresponding path program 1 times [2025-03-08 14:18:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:18:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091098755] [2025-03-08 14:18:43,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:18:43,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 14:18:43,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 14:18:43,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:43,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:18:43,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:18:43,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 14:18:43,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 14:18:43,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:43,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:18:43,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:18:43,876 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:18:43,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:18:43,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:18:43,880 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:18:43,913 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:18:43,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:18:43 BoogieIcfgContainer [2025-03-08 14:18:43,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:18:43,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:18:43,917 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:18:43,917 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:18:43,917 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:43" (3/4) ... [2025-03-08 14:18:43,919 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:18:43,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:18:43,920 INFO L158 Benchmark]: Toolchain (without parser) took 1127.67ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 40.4MB in the end (delta: 65.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 14:18:43,920 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:43,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.15ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:43,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.78ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:43,921 INFO L158 Benchmark]: Boogie Preprocessor took 19.78ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:43,922 INFO L158 Benchmark]: IcfgBuilder took 224.61ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 78.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:43,922 INFO L158 Benchmark]: TraceAbstraction took 699.91ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 40.4MB in the end (delta: 37.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 14:18:43,922 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 142.6MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:43,923 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.15ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.78ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.78ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 224.61ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 78.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 699.91ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 40.4MB in the end (delta: 37.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 142.6MB. Free memory is still 40.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 someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 36, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 32.7; [L30] double var_1_9 = 32.75; [L31] double last_1_var_1_8 = 32.7; VAL [isInitial=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L79] isInitial = 1 [L80] FCALL initially() [L81] int k_loop; [L82] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L82] COND TRUE k_loop < 1 [L83] CALL updateLastVariables() [L72] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L83] RET updateLastVariables() [L84] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L63] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L66] var_1_5 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L67] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L68] var_1_6 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L69] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L84] RET updateVariables() [L85] CALL step() [L35] COND TRUE \read(var_1_2) [L36] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L40] COND TRUE \read(var_1_2) [L41] var_1_7 = ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L44] COND TRUE var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6))) [L45] var_1_8 = (var_1_5 - var_1_3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_9=131/4] [L54] COND TRUE var_1_4 != (var_1_3 - var_1_5) [L55] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L85] RET step() [L86] CALL, EXPR property() [L75-L76] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_2 ? (var_1_7 == ((double) ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3))) : 1)) && (var_1_2 ? ((var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6)))) ? (var_1_8 == ((double) (var_1_5 - var_1_3))) : (var_1_8 == ((double) var_1_4))) : ((var_1_7 <= var_1_5) ? (var_1_8 == ((double) var_1_6)) : 1))) && ((var_1_4 != (var_1_3 - var_1_5)) ? (var_1_9 == ((double) var_1_6)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 54 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 6, 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, 46 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, 46 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 110/120 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-03-08 14:18:43,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:18:45,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:18:45,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:18:45,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:18:45,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:18:45,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:18:45,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:18:45,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:18:45,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:18:45,781 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:18:45,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:18:45,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:18:45,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:18:45,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:18:45,782 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:18:45,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:18:45,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:18:45,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:18:45,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:18:45,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:18:45,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:18:45,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:18:45,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:18:45,783 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:18:45,783 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:18:45,783 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:18:45,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:18:45,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:18:45,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:18:45,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:18:45,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:18:45,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:18:45,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:18:45,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:18:45,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:45,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:18:45,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:18:45,785 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:18:45,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:18:45,785 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:18:45,785 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:18:45,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:18:45,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:18:45,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:18:45,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:18:45,785 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/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 -> f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 [2025-03-08 14:18:46,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:18:46,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:18:46,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:18:46,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:18:46,038 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:18:46,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-08 14:18:47,245 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc8c04b5/cdb4dfd704b44f9ab37bd473739cd1fa/FLAGc54d51fa2 [2025-03-08 14:18:47,435 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:18:47,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-08 14:18:47,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc8c04b5/cdb4dfd704b44f9ab37bd473739cd1fa/FLAGc54d51fa2 [2025-03-08 14:18:47,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc8c04b5/cdb4dfd704b44f9ab37bd473739cd1fa [2025-03-08 14:18:47,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:18:47,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:18:47,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:47,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:18:47,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:18:47,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:47,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7a012d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47, skipping insertion in model container [2025-03-08 14:18:47,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:47,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:18:47,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-03-08 14:18:47,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:47,948 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:18:47,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-03-08 14:18:47,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:47,990 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:18:47,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47 WrapperNode [2025-03-08 14:18:47,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:47,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:47,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:18:47,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:18:47,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,022 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-08 14:18:48,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:48,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:18:48,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:18:48,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:18:48,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,036 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-03-08 14:18:48,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,041 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:18:48,045 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:18:48,045 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:18:48,045 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:18:48,046 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (1/1) ... [2025-03-08 14:18:48,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:48,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:18:48,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:18:48,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:18:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:18:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:18:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:18:48,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:18:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:18:48,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:18:48,129 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:18:48,130 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:18:54,416 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-08 14:18:54,416 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:18:54,421 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:18:54,421 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:18:54,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:54 BoogieIcfgContainer [2025-03-08 14:18:54,422 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:18:54,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:18:54,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:18:54,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:18:54,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:18:47" (1/3) ... [2025-03-08 14:18:54,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45991572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:54, skipping insertion in model container [2025-03-08 14:18:54,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:47" (2/3) ... [2025-03-08 14:18:54,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45991572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:54, skipping insertion in model container [2025-03-08 14:18:54,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:54" (3/3) ... [2025-03-08 14:18:54,429 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-08 14:18:54,438 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:18:54,439 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:18:54,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:18:54,479 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;@ee0f3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:18:54,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:18:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 14:18:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 14:18:54,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:54,488 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-03-08 14:18:54,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:54,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1840070575, now seen corresponding path program 1 times [2025-03-08 14:18:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:18:54,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926361896] [2025-03-08 14:18:54,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:54,500 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-03-08 14:18:54,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:18:54,502 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-08 14:18:54,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 14:18:54,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 14:18:54,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 14:18:54,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:54,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:54,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:18:54,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 14:18:54,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:18:54,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:18:54,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926361896] [2025-03-08 14:18:54,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926361896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:18:54,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:18:54,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:18:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563637950] [2025-03-08 14:18:54,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:18:54,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:18:54,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:18:54,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:18:54,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:18:54,884 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 14:18:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:18:54,895 INFO L93 Difference]: Finished difference Result 67 states and 99 transitions. [2025-03-08 14:18:54,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:18:54,896 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-03-08 14:18:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:18:54,900 INFO L225 Difference]: With dead ends: 67 [2025-03-08 14:18:54,900 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 14:18:54,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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-03-08 14:18:54,903 INFO L435 NwaCegarLoop]: 46 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, 46 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-03-08 14:18:54,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:18:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 14:18:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 14:18:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 14:18:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2025-03-08 14:18:54,925 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 49 [2025-03-08 14:18:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:18:54,926 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-03-08 14:18:54,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 14:18:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2025-03-08 14:18:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 14:18:54,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:54,927 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-03-08 14:18:54,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 14:18:55,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-08 14:18:55,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:55,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash -570374701, now seen corresponding path program 1 times [2025-03-08 14:18:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:18:55,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227247783] [2025-03-08 14:18:55,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:55,132 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-03-08 14:18:55,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:18:55,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-08 14:18:55,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 14:18:55,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 14:18:55,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 14:18:55,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:55,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:55,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 14:18:55,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:19:16,116 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:19:21,975 WARN L286 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:19:27,926 WARN L286 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:19:34,441 WARN L286 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:19:40,262 WARN L286 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:19:46,839 WARN L286 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:19:54,394 WARN L286 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:20:02,510 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:20:09,551 WARN L286 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:20:17,502 WARN L286 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:20:25,581 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)