./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-95.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 b884f210784373b42c472a85a9cfd5963822e872cafb602d6bfc9ce286fa4e8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:34:34,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:34:34,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:34:34,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:34:34,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:34:34,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:34:34,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:34:34,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:34:34,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:34:34,247 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:34:34,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:34:34,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:34:34,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:34:34,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:34:34,248 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:34:34,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:34:34,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:34:34,248 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:34:34,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:34:34,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:34:34,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:34:34,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:34:34,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:34:34,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:34:34,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:34:34,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:34:34,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:34:34,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:34:34,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:34:34,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:34:34,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:34:34,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:34:34,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:34:34,251 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 -> b884f210784373b42c472a85a9cfd5963822e872cafb602d6bfc9ce286fa4e8a [2025-03-17 03:34:34,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:34:34,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:34:34,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:34:34,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:34:34,469 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:34:34,470 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-95.i [2025-03-17 03:34:35,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974d86c89/fb439604ebfe437cb18939b1fa45417d/FLAG53c975a28 [2025-03-17 03:34:35,890 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:34:35,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i [2025-03-17 03:34:35,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974d86c89/fb439604ebfe437cb18939b1fa45417d/FLAG53c975a28 [2025-03-17 03:34:36,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974d86c89/fb439604ebfe437cb18939b1fa45417d [2025-03-17 03:34:36,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:34:36,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:34:36,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:34:36,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:34:36,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:34:36,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e365b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36, skipping insertion in model container [2025-03-17 03:34:36,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:34:36,306 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-95.i[915,928] [2025-03-17 03:34:36,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:34:36,357 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:34:36,364 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-95.i[915,928] [2025-03-17 03:34:36,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:34:36,396 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:34:36,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36 WrapperNode [2025-03-17 03:34:36,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:34:36,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:34:36,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:34:36,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:34:36,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,422 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-17 03:34:36,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:34:36,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:34:36,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:34:36,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:34:36,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,440 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-17 03:34:36,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:34:36,450 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:34:36,450 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:34:36,450 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:34:36,451 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (1/1) ... [2025-03-17 03:34:36,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:34:36,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:34:36,477 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-17 03:34:36,482 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-17 03:34:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:34:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:34:36,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:34:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:34:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:34:36,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:34:36,541 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:34:36,542 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:34:36,704 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 03:34:36,704 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:34:36,710 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:34:36,711 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:34:36,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:34:36 BoogieIcfgContainer [2025-03-17 03:34:36,711 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:34:36,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:34:36,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:34:36,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:34:36,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:34:36" (1/3) ... [2025-03-17 03:34:36,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26456885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:34:36, skipping insertion in model container [2025-03-17 03:34:36,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:36" (2/3) ... [2025-03-17 03:34:36,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26456885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:34:36, skipping insertion in model container [2025-03-17 03:34:36,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:34:36" (3/3) ... [2025-03-17 03:34:36,719 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-95.i [2025-03-17 03:34:36,730 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:34:36,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-95.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:34:36,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:34:36,780 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;@1c7c899, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:34:36,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:34:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 03:34:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 03:34:36,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:34:36,790 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:34:36,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:34:36,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:34:36,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1966156169, now seen corresponding path program 1 times [2025-03-17 03:34:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:34:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229348895] [2025-03-17 03:34:36,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:34:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:34:36,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 03:34:36,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 03:34:36,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:34:36,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:34:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 03:34:36,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:34:36,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229348895] [2025-03-17 03:34:36,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229348895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:34:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675905986] [2025-03-17 03:34:36,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:34:36,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:34:36,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:34:36,996 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-17 03:34:36,998 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-17 03:34:37,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 03:34:37,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 03:34:37,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:34:37,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:34:37,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:34:37,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:34:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 03:34:37,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:34:37,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675905986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:34:37,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:34:37,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:34:37,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247257305] [2025-03-17 03:34:37,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:34:37,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:34:37,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:34:37,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:34:37,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:34:37,153 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:34:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:34:37,166 INFO L93 Difference]: Finished difference Result 75 states and 124 transitions. [2025-03-17 03:34:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:34:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 79 [2025-03-17 03:34:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:34:37,172 INFO L225 Difference]: With dead ends: 75 [2025-03-17 03:34:37,172 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 03:34:37,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-17 03:34:37,177 INFO L435 NwaCegarLoop]: 54 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, 54 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-17 03:34:37,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:34:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 03:34:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-17 03:34:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 03:34:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2025-03-17 03:34:37,210 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 79 [2025-03-17 03:34:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:34:37,210 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2025-03-17 03:34:37,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:34:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2025-03-17 03:34:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 03:34:37,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:34:37,212 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:34:37,219 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-17 03:34:37,415 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-17 03:34:37,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:34:37,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:34:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1654733670, now seen corresponding path program 1 times [2025-03-17 03:34:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:34:37,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998254879] [2025-03-17 03:34:37,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:34:37,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:34:37,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 03:34:37,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 03:34:37,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:34:37,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:34:37,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:34:37,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 03:34:37,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 03:34:37,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:34:37,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:34:37,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:34:37,603 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:34:37,604 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:34:37,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:34:37,608 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:34:37,648 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:34:37,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:34:37 BoogieIcfgContainer [2025-03-17 03:34:37,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:34:37,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:34:37,653 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:34:37,653 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:34:37,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:34:36" (3/4) ... [2025-03-17 03:34:37,655 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:34:37,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:34:37,657 INFO L158 Benchmark]: Toolchain (without parser) took 1470.38ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 51.6MB in the end (delta: 81.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-17 03:34:37,658 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:34:37,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.74ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 119.8MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:34:37,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.26ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 117.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:34:37,660 INFO L158 Benchmark]: Boogie Preprocessor took 23.44ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 115.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:34:37,661 INFO L158 Benchmark]: IcfgBuilder took 261.17ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 101.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:34:37,661 INFO L158 Benchmark]: TraceAbstraction took 939.39ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 51.6MB in the end (delta: 49.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 03:34:37,661 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 167.8MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:34:37,662 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.92ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.74ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 119.8MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.26ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 117.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.44ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 115.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 261.17ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 101.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 939.39ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 51.6MB in the end (delta: 49.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 167.8MB. Free memory is still 51.6MB. 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 71, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] float var_1_3 = 1.8; [L24] double var_1_5 = -0.75; [L25] double var_1_6 = 128.2; [L26] float var_1_8 = 127.4; [L27] float var_1_9 = 99999999.4; [L28] float var_1_10 = 2.8; [L29] double var_1_11 = 7.875; [L30] unsigned char var_1_12 = 128; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 25; [L33] unsigned char var_1_15 = 64; [L34] signed short int var_1_16 = 16; [L89] isInitial = 1 [L90] FCALL initially() [L91] int k_loop; [L92] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L92] COND TRUE k_loop < 1 [L93] FCALL updateLastVariables() [L94] CALL updateVariables() [L60] var_1_5 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L61] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L62] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L62] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L63] var_1_6 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L64] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L65] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L65] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L66] var_1_8 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_9=499999997/5] [L67] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_9=499999997/5] [L68] var_1_9 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L69] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L71] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L72] var_1_13 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L73] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L74] CALL assume_abort_if_not(var_1_13 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L74] RET assume_abort_if_not(var_1_13 <= 64) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L77] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L77] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L78] var_1_15 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L79] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L80] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=127, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=127, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L80] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=127, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L94] RET updateVariables() [L95] CALL step() [L38] var_1_11 = (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) - var_1_8) [L39] var_1_12 = ((var_1_13 + var_1_14) + var_1_15) [L40] var_1_16 = var_1_13 [L41] var_1_1 = ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) [L42] unsigned char stepLocal_2 = var_1_12; [L43] signed long int stepLocal_1 = -128; [L44] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=254, stepLocal_1=-128, stepLocal_2=254, var_1_12=254, var_1_13=64, var_1_14=63, var_1_15=127, var_1_16=64, var_1_1=254, var_1_3=9/5] [L45] COND FALSE !((var_1_11 / ((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) <= var_1_11) VAL [isInitial=1, stepLocal_0=254, stepLocal_1=-128, stepLocal_2=254, var_1_12=254, var_1_13=64, var_1_14=63, var_1_15=127, var_1_16=64, var_1_1=254, var_1_3=9/5] [L95] RET step() [L96] CALL, EXPR property() [L85-L86] return ((((var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))))) && (((var_1_11 / ((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) <= var_1_11) ? ((var_1_12 == var_1_16) ? ((var_1_12 >= var_1_16) ? (var_1_3 == ((float) ((9.3f - var_1_8) + (var_1_9 + var_1_10)))) : 1) : ((var_1_12 < -128) ? (var_1_3 == ((float) var_1_8)) : (var_1_3 == ((float) var_1_10)))) : 1)) && (var_1_11 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) - var_1_8)))) && (var_1_12 == ((unsigned char) ((var_1_13 + var_1_14) + var_1_15)))) && (var_1_16 == ((signed short int) var_1_13)) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=254, var_1_13=64, var_1_14=63, var_1_15=127, var_1_16=64, var_1_1=254, var_1_3=9/5] [L19] reach_error() VAL [isInitial=1, var_1_12=254, var_1_13=64, var_1_14=63, var_1_15=127, var_1_16=64, var_1_1=254, var_1_3=9/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 69 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 13, 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, 54 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, 54 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 600/624 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-17 03:34:37,677 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-95.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 b884f210784373b42c472a85a9cfd5963822e872cafb602d6bfc9ce286fa4e8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:34:39,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:34:39,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:34:39,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:34:39,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:34:39,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:34:39,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:34:39,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:34:39,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:34:39,698 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:34:39,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:34:39,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:34:39,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:34:39,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:34:39,699 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:34:39,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:34:39,700 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:34:39,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:34:39,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:34:39,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:34:39,701 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:34:39,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:34:39,701 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:34:39,701 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:34:39,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:34:39,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:34:39,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:34:39,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:34:39,701 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 -> b884f210784373b42c472a85a9cfd5963822e872cafb602d6bfc9ce286fa4e8a [2025-03-17 03:34:39,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:34:39,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:34:39,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:34:39,971 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:34:39,971 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:34:39,972 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-95.i [2025-03-17 03:34:41,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d75565e7/1dd2a85dec31498f8babbbdce6f3212a/FLAG090b842cc [2025-03-17 03:34:41,389 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:34:41,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i [2025-03-17 03:34:41,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d75565e7/1dd2a85dec31498f8babbbdce6f3212a/FLAG090b842cc [2025-03-17 03:34:41,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d75565e7/1dd2a85dec31498f8babbbdce6f3212a [2025-03-17 03:34:41,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:34:41,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:34:41,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:34:41,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:34:41,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:34:41,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:41,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e31555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41, skipping insertion in model container [2025-03-17 03:34:41,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:41,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:34:41,855 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-95.i[915,928] [2025-03-17 03:34:41,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:34:41,895 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:34:41,903 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-95.i[915,928] [2025-03-17 03:34:41,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:34:41,930 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:34:41,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41 WrapperNode [2025-03-17 03:34:41,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:34:41,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:34:41,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:34:41,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:34:41,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:41,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:41,970 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-17 03:34:41,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:34:41,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:34:41,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:34:41,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:34:41,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:41,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:41,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:41,996 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-17 03:34:41,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:41,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:42,004 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:42,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:42,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:42,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:42,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:34:42,019 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:34:42,019 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:34:42,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:34:42,020 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (1/1) ... [2025-03-17 03:34:42,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:34:42,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:34:42,048 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-17 03:34:42,055 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-17 03:34:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:34:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:34:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:34:42,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:34:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:34:42,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:34:42,143 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:34:42,145 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:34:56,111 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 03:34:56,111 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:34:56,118 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:34:56,118 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:34:56,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:34:56 BoogieIcfgContainer [2025-03-17 03:34:56,119 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:34:56,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:34:56,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:34:56,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:34:56,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:34:41" (1/3) ... [2025-03-17 03:34:56,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269b0789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:34:56, skipping insertion in model container [2025-03-17 03:34:56,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:34:41" (2/3) ... [2025-03-17 03:34:56,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269b0789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:34:56, skipping insertion in model container [2025-03-17 03:34:56,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:34:56" (3/3) ... [2025-03-17 03:34:56,125 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-95.i [2025-03-17 03:34:56,135 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:34:56,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-95.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:34:56,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:34:56,184 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14211642, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:34:56,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:34:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 03:34:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 03:34:56,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:34:56,195 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:34:56,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:34:56,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:34:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1966156169, now seen corresponding path program 1 times [2025-03-17 03:34:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:34:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124642844] [2025-03-17 03:34:56,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:34:56,206 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-17 03:34:56,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:34:56,210 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-17 03:34:56,211 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-17 03:34:56,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 03:34:57,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 03:34:57,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:34:57,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:34:57,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:34:57,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:34:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 03:34:57,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:34:57,124 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:34:57,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124642844] [2025-03-17 03:34:57,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124642844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:34:57,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:34:57,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:34:57,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120246823] [2025-03-17 03:34:57,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:34:57,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:34:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:34:57,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:34:57,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:34:57,144 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:34:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:34:57,161 INFO L93 Difference]: Finished difference Result 75 states and 124 transitions. [2025-03-17 03:34:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:34:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 79 [2025-03-17 03:34:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:34:57,169 INFO L225 Difference]: With dead ends: 75 [2025-03-17 03:34:57,170 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 03:34:57,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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-17 03:34:57,176 INFO L435 NwaCegarLoop]: 54 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, 54 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-17 03:34:57,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:34:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 03:34:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-17 03:34:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 03:34:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2025-03-17 03:34:57,205 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 79 [2025-03-17 03:34:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:34:57,206 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2025-03-17 03:34:57,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:34:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2025-03-17 03:34:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 03:34:57,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:34:57,209 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:34:57,237 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-17 03:34:57,409 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-17 03:34:57,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:34:57,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:34:57,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1654733670, now seen corresponding path program 1 times [2025-03-17 03:34:57,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:34:57,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474744110] [2025-03-17 03:34:57,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:34:57,411 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-17 03:34:57,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:34:57,414 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-17 03:34:57,424 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-17 03:34:57,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 03:34:58,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 03:34:58,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:34:58,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:34:58,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 03:34:58,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:06,543 WARN L286 SmtUtils]: Spent 18.64s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 03:36:15,358 WARN L286 SmtUtils]: Spent 8.80s 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)