./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-36.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 a9b1c8c7de7465c515d06d0ced1ed1656ccb9172ea644417a0d2bfef8979d833 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:08:45,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:08:45,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:08:45,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:08:45,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:08:45,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:08:45,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:08:45,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:08:45,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:08:45,536 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:08:45,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:08:45,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:08:45,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:08:45,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:08:45,538 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:08:45,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:08:45,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:08:45,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:08:45,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:08:45,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:08:45,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:08:45,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:08:45,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:08:45,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:08:45,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:08:45,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:08:45,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:08:45,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:08:45,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:08:45,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:08:45,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:08:45,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:08:45,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:08:45,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:08:45,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:08:45,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:08:45,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:08:45,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:08:45,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:08:45,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:08:45,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:08:45,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:08:45,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:08:45,541 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 -> a9b1c8c7de7465c515d06d0ced1ed1656ccb9172ea644417a0d2bfef8979d833 [2025-03-03 23:08:45,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:08:45,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:08:45,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:08:45,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:08:45,796 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:08:45,798 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-36.i [2025-03-03 23:08:46,912 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d995e469d/f5206bb0f32d4c4ea165ef645a429d3b/FLAGfcc1a881a [2025-03-03 23:08:47,128 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:08:47,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-36.i [2025-03-03 23:08:47,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d995e469d/f5206bb0f32d4c4ea165ef645a429d3b/FLAGfcc1a881a [2025-03-03 23:08:47,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d995e469d/f5206bb0f32d4c4ea165ef645a429d3b [2025-03-03 23:08:47,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:08:47,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:08:47,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:08:47,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:08:47,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:08:47,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4292816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47, skipping insertion in model container [2025-03-03 23:08:47,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:08:47,584 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-36.i[915,928] [2025-03-03 23:08:47,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:08:47,611 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:08:47,617 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-36.i[915,928] [2025-03-03 23:08:47,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:08:47,638 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:08:47,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47 WrapperNode [2025-03-03 23:08:47,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:08:47,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:08:47,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:08:47,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:08:47,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,667 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-03-03 23:08:47,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:08:47,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:08:47,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:08:47,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:08:47,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,684 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-03 23:08:47,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,687 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:08:47,691 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:08:47,691 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:08:47,691 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:08:47,691 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (1/1) ... [2025-03-03 23:08:47,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:08:47,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:08:47,713 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-03 23:08:47,717 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-03 23:08:47,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:08:47,730 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:08:47,730 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:08:47,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:08:47,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:08:47,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:08:47,782 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:08:47,783 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:08:47,921 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:08:47,921 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:08:47,927 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:08:47,927 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:08:47,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:08:47 BoogieIcfgContainer [2025-03-03 23:08:47,927 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:08:47,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:08:47,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:08:47,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:08:47,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:08:47" (1/3) ... [2025-03-03 23:08:47,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726a9a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:08:47, skipping insertion in model container [2025-03-03 23:08:47,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:47" (2/3) ... [2025-03-03 23:08:47,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726a9a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:08:47, skipping insertion in model container [2025-03-03 23:08:47,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:08:47" (3/3) ... [2025-03-03 23:08:47,934 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-36.i [2025-03-03 23:08:47,945 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:08:47,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-36.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:08:47,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:08:48,000 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;@75ef2b90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:08:48,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:08:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 23:08:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 23:08:48,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:08:48,010 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:08:48,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:08:48,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:08:48,015 INFO L85 PathProgramCache]: Analyzing trace with hash 464555463, now seen corresponding path program 1 times [2025-03-03 23:08:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:08:48,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150049449] [2025-03-03 23:08:48,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:08:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:08:48,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 23:08:48,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 23:08:48,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:08:48,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:08:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-03 23:08:48,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:08:48,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150049449] [2025-03-03 23:08:48,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150049449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:08:48,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873480644] [2025-03-03 23:08:48,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:08:48,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:08:48,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:08:48,210 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-03 23:08:48,211 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-03 23:08:48,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 23:08:48,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 23:08:48,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:08:48,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:08:48,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:08:48,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:08:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-03 23:08:48,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:08:48,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873480644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:08:48,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:08:48,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:08:48,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845718488] [2025-03-03 23:08:48,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:08:48,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:08:48,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:08:48,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:08:48,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:08:48,350 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 23:08:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:08:48,362 INFO L93 Difference]: Finished difference Result 75 states and 114 transitions. [2025-03-03 23:08:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:08:48,363 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-03-03 23:08:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:08:48,366 INFO L225 Difference]: With dead ends: 75 [2025-03-03 23:08:48,367 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 23:08:48,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-03 23:08:48,370 INFO L435 NwaCegarLoop]: 52 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, 52 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-03 23:08:48,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:08:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 23:08:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 23:08:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 23:08:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-03 23:08:48,398 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 64 [2025-03-03 23:08:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:08:48,398 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-03 23:08:48,398 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 23:08:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-03 23:08:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 23:08:48,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:08:48,400 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:08:48,406 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-03 23:08:48,600 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-03 23:08:48,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:08:48,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:08:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1345361860, now seen corresponding path program 1 times [2025-03-03 23:08:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:08:48,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308876110] [2025-03-03 23:08:48,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:08:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:08:48,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 23:08:48,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 23:08:48,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:08:48,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:08:48,675 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:08:48,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 23:08:48,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 23:08:48,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:08:48,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:08:48,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:08:48,731 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:08:48,734 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:08:48,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:08:48,738 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:08:48,779 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:08:48,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:08:48 BoogieIcfgContainer [2025-03-03 23:08:48,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:08:48,783 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:08:48,783 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:08:48,783 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:08:48,784 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:08:47" (3/4) ... [2025-03-03 23:08:48,785 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:08:48,786 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:08:48,787 INFO L158 Benchmark]: Toolchain (without parser) took 1302.65ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 103.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2025-03-03 23:08:48,787 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:08:48,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.82ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 95.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:08:48,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.95ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:08:48,787 INFO L158 Benchmark]: Boogie Preprocessor took 20.85ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:08:48,787 INFO L158 Benchmark]: IcfgBuilder took 236.66ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 77.4MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:08:48,788 INFO L158 Benchmark]: TraceAbstraction took 853.77ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 103.9MB in the end (delta: -26.8MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2025-03-03 23:08:48,788 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 103.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:08:48,789 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 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.82ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 95.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.95ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.85ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 236.66ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 77.4MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 853.77ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 103.9MB in the end (delta: -26.8MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 103.9MB in the end (delta: 27.1kB). 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 63, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] float var_1_6 = 2.375; [L25] float var_1_7 = 10.8; [L26] double var_1_9 = 9.6; [L27] double var_1_12 = 128.5; [L28] unsigned char var_1_13 = 128; [L29] float var_1_14 = 8.5; [L30] unsigned char var_1_15 = 128; [L31] unsigned char last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=0, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L81] isInitial = 1 [L82] FCALL initially() [L83] int k_loop; [L84] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=0, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L84] COND TRUE k_loop < 1 [L85] CALL updateLastVariables() [L74] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=0, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L85] RET updateLastVariables() [L86] CALL updateVariables() [L57] var_1_4 = __VERIFIER_nondet_uchar() [L58] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L58] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L59] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L59] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L60] var_1_6 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_7=54/5, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_7=54/5, var_1_9=48/5] [L61] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_7=54/5, var_1_9=48/5] [L62] var_1_7 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L63] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L64] var_1_12 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L65] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L66] var_1_14 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L67] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L68] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L68] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L69] var_1_15 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L70] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L71] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L71] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L86] RET updateVariables() [L87] CALL step() [L35] COND TRUE ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < (last_1_var_1_13 + last_1_var_1_13) [L36] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=254] [L38] COND TRUE var_1_9 <= (16.2f / var_1_14) [L39] var_1_13 = (var_1_15 - 5) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=254] [L41] unsigned char stepLocal_0 = var_1_9 > var_1_9; VAL [isInitial=1, last_1_var_1_13=128, stepLocal_0=0, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=254] [L42] COND FALSE !(stepLocal_0 && var_1_4) [L53] var_1_1 = var_1_13 VAL [isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=249, var_1_4=1, var_1_9=254] [L87] RET step() [L88] CALL, EXPR property() [L77-L78] return ((((var_1_9 > var_1_9) && var_1_4) ? ((((((var_1_9) > ((- var_1_9))) ? (var_1_9) : ((- var_1_9)))) != var_1_9) ? ((! (var_1_9 >= (var_1_6 - var_1_7))) ? (var_1_1 == ((unsigned long int) var_1_13)) : (var_1_1 == ((unsigned long int) var_1_13))) : (var_1_1 == ((unsigned long int) var_1_13))) : (var_1_1 == ((unsigned long int) var_1_13))) && ((((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < (last_1_var_1_13 + last_1_var_1_13)) ? (var_1_9 == ((double) var_1_12)) : 1)) && ((var_1_9 <= (16.2f / var_1_14)) ? (var_1_13 == ((unsigned char) (var_1_15 - 5))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=249, var_1_4=1, var_1_9=254] [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=249, var_1_4=1, var_1_9=254] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=249, var_1_4=1, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 9, 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, 52 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, 52 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 162 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 272/288 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-03 23:08:48,803 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-36.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 a9b1c8c7de7465c515d06d0ced1ed1656ccb9172ea644417a0d2bfef8979d833 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:08:50,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:08:50,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:08:50,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:08:50,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:08:50,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:08:50,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:08:50,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:08:50,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:08:50,672 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:08:50,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:08:50,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:08:50,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:08:50,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:08:50,673 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:08:50,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:08:50,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:08:50,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:08:50,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:08:50,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:08:50,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:08:50,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:08:50,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:08:50,675 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:08:50,675 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:08:50,675 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:08:50,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:08:50,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:08:50,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:08:50,675 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:08:50,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:08:50,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:08:50,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:08:50,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:08:50,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:08:50,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:08:50,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:08:50,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:08:50,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:08:50,676 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:08:50,676 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:08:50,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:08:50,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:08:50,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:08:50,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:08:50,677 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 -> a9b1c8c7de7465c515d06d0ced1ed1656ccb9172ea644417a0d2bfef8979d833 [2025-03-03 23:08:50,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:08:50,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:08:50,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:08:50,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:08:50,912 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:08:50,913 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-36.i [2025-03-03 23:08:52,028 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381cf2968/80c624a53cea4e67b711d9cef2fe40f8/FLAG1018f9743 [2025-03-03 23:08:52,223 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:08:52,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-36.i [2025-03-03 23:08:52,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381cf2968/80c624a53cea4e67b711d9cef2fe40f8/FLAG1018f9743 [2025-03-03 23:08:52,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381cf2968/80c624a53cea4e67b711d9cef2fe40f8 [2025-03-03 23:08:52,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:08:52,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:08:52,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:08:52,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:08:52,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:08:52,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3e8c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52, skipping insertion in model container [2025-03-03 23:08:52,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:08:52,366 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-36.i[915,928] [2025-03-03 23:08:52,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:08:52,411 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:08:52,419 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-36.i[915,928] [2025-03-03 23:08:52,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:08:52,455 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:08:52,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52 WrapperNode [2025-03-03 23:08:52,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:08:52,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:08:52,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:08:52,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:08:52,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,493 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-03-03 23:08:52,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:08:52,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:08:52,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:08:52,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:08:52,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,514 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-03 23:08:52,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,524 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:08:52,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:08:52,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:08:52,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:08:52,537 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (1/1) ... [2025-03-03 23:08:52,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:08:52,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:08:52,568 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-03 23:08:52,574 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-03 23:08:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:08:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:08:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:08:52,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:08:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:08:52,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:08:52,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:08:52,658 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:08:55,863 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:08:55,863 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:08:55,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:08:55,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:08:55,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:08:55 BoogieIcfgContainer [2025-03-03 23:08:55,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:08:55,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:08:55,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:08:55,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:08:55,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:08:52" (1/3) ... [2025-03-03 23:08:55,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc15adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:08:55, skipping insertion in model container [2025-03-03 23:08:55,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:08:52" (2/3) ... [2025-03-03 23:08:55,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc15adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:08:55, skipping insertion in model container [2025-03-03 23:08:55,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:08:55" (3/3) ... [2025-03-03 23:08:55,875 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-36.i [2025-03-03 23:08:55,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:08:55,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-36.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:08:55,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:08:55,929 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;@22748824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:08:55,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:08:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 23:08:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 23:08:55,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:08:55,936 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:08:55,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:08:55,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:08:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash 464555463, now seen corresponding path program 1 times [2025-03-03 23:08:55,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:08:55,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933092202] [2025-03-03 23:08:55,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:08:55,945 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-03 23:08:55,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:08:55,948 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-03 23:08:55,948 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-03 23:08:56,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 23:08:56,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 23:08:56,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:08:56,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:08:56,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:08:56,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:08:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 23:08:56,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:08:56,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:08:56,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933092202] [2025-03-03 23:08:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933092202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:08:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:08:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:08:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462247028] [2025-03-03 23:08:56,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:08:56,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:08:56,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:08:56,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:08:56,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:08:56,224 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 23:08:56,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:08:56,237 INFO L93 Difference]: Finished difference Result 75 states and 114 transitions. [2025-03-03 23:08:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:08:56,238 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-03-03 23:08:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:08:56,242 INFO L225 Difference]: With dead ends: 75 [2025-03-03 23:08:56,242 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 23:08:56,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 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-03 23:08:56,245 INFO L435 NwaCegarLoop]: 52 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, 52 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-03 23:08:56,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:08:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 23:08:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 23:08:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 23:08:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-03 23:08:56,268 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 64 [2025-03-03 23:08:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:08:56,269 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-03 23:08:56,269 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 23:08:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-03 23:08:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 23:08:56,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:08:56,270 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:08:56,279 INFO L552 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)] Ended with exit code 0 [2025-03-03 23:08:56,471 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-03 23:08:56,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:08:56,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:08:56,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1345361860, now seen corresponding path program 1 times [2025-03-03 23:08:56,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:08:56,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540704115] [2025-03-03 23:08:56,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:08:56,473 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-03 23:08:56,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:08:56,475 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-03 23:08:56,475 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-03 23:08:56,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 23:08:56,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 23:08:56,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:08:56,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:08:56,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 23:08:56,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:09:24,614 WARN L286 SmtUtils]: Spent 7.60s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 23:10:10,326 WARN L286 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 23:10:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-03 23:10:34,048 INFO L312 TraceCheckSpWp]: Computing backward predicates...