./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.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 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:43:32,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:43:32,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:43:32,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:43:32,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:43:32,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:43:32,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:43:32,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:43:32,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:43:32,946 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:43:32,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:43:32,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:43:32,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:43:32,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:43:32,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:43:32,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:43:32,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:43:32,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:43:32,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:43:32,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:43:32,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:43:32,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:43:32,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:43:32,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:43:32,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:43:32,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:43:32,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:43:32,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:43:32,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:43:32,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:43:32,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:43:32,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:43:32,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:43:32,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:43:32,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:43:32,950 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:43:32,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:43:32,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:43:32,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:43:32,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:43:32,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:43:32,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:43:32,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:43:32,951 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 -> 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 [2025-03-08 14:43:33,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:43:33,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:43:33,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:43:33,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:43:33,167 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:43:33,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2025-03-08 14:43:34,253 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2e6d6fd/2a46a0169e8c4fb3ac421ab26cf15542/FLAGa4db9f08a [2025-03-08 14:43:34,498 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:43:34,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2025-03-08 14:43:34,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2e6d6fd/2a46a0169e8c4fb3ac421ab26cf15542/FLAGa4db9f08a [2025-03-08 14:43:34,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2e6d6fd/2a46a0169e8c4fb3ac421ab26cf15542 [2025-03-08 14:43:34,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:43:34,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:43:34,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:43:34,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:43:34,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:43:34,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:43:34" (1/1) ... [2025-03-08 14:43:34,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d4889b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:34, skipping insertion in model container [2025-03-08 14:43:34,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:43:34" (1/1) ... [2025-03-08 14:43:34,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:43:34,924 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_50-1loop_file-42.i[915,928] [2025-03-08 14:43:34,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:43:34,985 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:43:34,991 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_50-1loop_file-42.i[915,928] [2025-03-08 14:43:35,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:43:35,019 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:43:35,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35 WrapperNode [2025-03-08 14:43:35,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:43:35,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:43:35,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:43:35,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:43:35,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,052 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2025-03-08 14:43:35,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:43:35,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:43:35,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:43:35,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:43:35,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,074 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:43:35,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:43:35,083 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:43:35,083 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:43:35,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:43:35,083 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (1/1) ... [2025-03-08 14:43:35,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:43:35,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:43:35,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:43:35,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:43:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:43:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:43:35,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:43:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:43:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:43:35,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:43:35,169 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:43:35,170 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:43:35,375 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-08 14:43:35,376 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:43:35,384 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:43:35,385 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:43:35,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:43:35 BoogieIcfgContainer [2025-03-08 14:43:35,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:43:35,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:43:35,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:43:35,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:43:35,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:43:34" (1/3) ... [2025-03-08 14:43:35,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240e9cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:43:35, skipping insertion in model container [2025-03-08 14:43:35,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:35" (2/3) ... [2025-03-08 14:43:35,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240e9cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:43:35, skipping insertion in model container [2025-03-08 14:43:35,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:43:35" (3/3) ... [2025-03-08 14:43:35,394 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-42.i [2025-03-08 14:43:35,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:43:35,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-42.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:43:35,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:43:35,448 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;@25988683, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:43:35,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:43:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 14:43:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 14:43:35,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:35,456 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:35,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:35,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash -786945993, now seen corresponding path program 1 times [2025-03-08 14:43:35,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:43:35,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883511278] [2025-03-08 14:43:35,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:35,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:43:35,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 14:43:35,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 14:43:35,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:35,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 14:43:35,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:43:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883511278] [2025-03-08 14:43:35,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883511278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:43:35,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:43:35,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:43:35,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477594212] [2025-03-08 14:43:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:43:35,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:43:35,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:43:35,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:43:35,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:43:35,998 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:36,085 INFO L93 Difference]: Finished difference Result 154 states and 250 transitions. [2025-03-08 14:43:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:43:36,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-03-08 14:43:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:36,093 INFO L225 Difference]: With dead ends: 154 [2025-03-08 14:43:36,093 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 14:43:36,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:43:36,100 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 79 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:36,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 204 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:43:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 14:43:36,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2025-03-08 14:43:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 14:43:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2025-03-08 14:43:36,130 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 87 [2025-03-08 14:43:36,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:36,130 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2025-03-08 14:43:36,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2025-03-08 14:43:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 14:43:36,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:36,132 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:36,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 14:43:36,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:36,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:36,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1134774804, now seen corresponding path program 1 times [2025-03-08 14:43:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:43:36,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990540567] [2025-03-08 14:43:36,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:43:36,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:36,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:36,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:36,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 14:43:36,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:43:36,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990540567] [2025-03-08 14:43:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990540567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:43:36,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:43:36,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:43:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257688957] [2025-03-08 14:43:36,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:43:36,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:43:36,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:43:36,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:43:36,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:43:36,434 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:36,656 INFO L93 Difference]: Finished difference Result 211 states and 311 transitions. [2025-03-08 14:43:36,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:43:36,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-03-08 14:43:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:36,658 INFO L225 Difference]: With dead ends: 211 [2025-03-08 14:43:36,659 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 14:43:36,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:43:36,662 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 100 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:36,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 294 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:43:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 14:43:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 119. [2025-03-08 14:43:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 14:43:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2025-03-08 14:43:36,694 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 88 [2025-03-08 14:43:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:36,695 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2025-03-08 14:43:36,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2025-03-08 14:43:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 14:43:36,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:36,696 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:36,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:43:36,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:36,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash 372777005, now seen corresponding path program 1 times [2025-03-08 14:43:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:43:36,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165494862] [2025-03-08 14:43:36,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:43:36,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:36,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:36,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:36,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 14:43:36,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:43:36,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165494862] [2025-03-08 14:43:36,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165494862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:43:36,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:43:36,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:43:36,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004921264] [2025-03-08 14:43:36,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:43:36,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:43:36,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:43:36,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:43:36,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:43:36,834 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:36,866 INFO L93 Difference]: Finished difference Result 209 states and 308 transitions. [2025-03-08 14:43:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:43:36,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-03-08 14:43:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:36,870 INFO L225 Difference]: With dead ends: 209 [2025-03-08 14:43:36,870 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 14:43:36,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:43:36,871 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:36,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:43:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 14:43:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-08 14:43:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 14:43:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-03-08 14:43:36,892 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 88 [2025-03-08 14:43:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:36,892 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-03-08 14:43:36,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-03-08 14:43:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 14:43:36,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:36,894 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:36,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:43:36,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:36,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1434677458, now seen corresponding path program 1 times [2025-03-08 14:43:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:43:36,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210718342] [2025-03-08 14:43:36,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:43:36,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:36,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:36,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:36,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-08 14:43:37,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:43:37,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210718342] [2025-03-08 14:43:37,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210718342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:43:37,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673334981] [2025-03-08 14:43:37,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:37,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:43:37,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:43:37,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:43:37,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:43:37,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:37,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:37,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:37,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:37,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 14:43:37,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 14:43:37,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:43:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-03-08 14:43:37,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673334981] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:43:37,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:43:37,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-08 14:43:37,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569991541] [2025-03-08 14:43:37,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:43:37,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 14:43:37,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:43:37,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 14:43:37,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:43:37,848 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 14:43:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:38,416 INFO L93 Difference]: Finished difference Result 382 states and 511 transitions. [2025-03-08 14:43:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 14:43:38,416 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 88 [2025-03-08 14:43:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:38,418 INFO L225 Difference]: With dead ends: 382 [2025-03-08 14:43:38,418 INFO L226 Difference]: Without dead ends: 336 [2025-03-08 14:43:38,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=482, Invalid=1410, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 14:43:38,420 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 259 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:38,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 337 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:43:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-08 14:43:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 204. [2025-03-08 14:43:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 143 states have internal predecessors, (177), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:43:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 273 transitions. [2025-03-08 14:43:38,457 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 273 transitions. Word has length 88 [2025-03-08 14:43:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:38,459 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 273 transitions. [2025-03-08 14:43:38,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 14:43:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 273 transitions. [2025-03-08 14:43:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 14:43:38,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:38,462 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:38,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 14:43:38,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:43:38,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:38,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1940236083, now seen corresponding path program 1 times [2025-03-08 14:43:38,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:43:38,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236145540] [2025-03-08 14:43:38,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:38,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:43:38,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:38,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:38,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:38,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:43:38,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481547358] [2025-03-08 14:43:38,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:38,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:43:38,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:43:38,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:43:38,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:43:38,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:38,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:38,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:38,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:38,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 14:43:38,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 14:43:39,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:43:39,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:43:39,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236145540] [2025-03-08 14:43:39,724 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:43:39,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481547358] [2025-03-08 14:43:39,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481547358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:43:39,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:43:39,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-08 14:43:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532878275] [2025-03-08 14:43:39,724 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:43:39,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 14:43:39,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:43:39,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 14:43:39,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2025-03-08 14:43:39,725 INFO L87 Difference]: Start difference. First operand 204 states and 273 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 14:43:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:40,168 INFO L93 Difference]: Finished difference Result 634 states and 819 transitions. [2025-03-08 14:43:40,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 14:43:40,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 88 [2025-03-08 14:43:40,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:40,172 INFO L225 Difference]: With dead ends: 634 [2025-03-08 14:43:40,172 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 14:43:40,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=328, Invalid=794, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 14:43:40,174 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 125 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:40,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 529 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:43:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 14:43:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 440. [2025-03-08 14:43:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 320 states have (on average 1.23125) internal successors, (394), 322 states have internal predecessors, (394), 88 states have call successors, (88), 31 states have call predecessors, (88), 31 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 14:43:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 570 transitions. [2025-03-08 14:43:40,235 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 570 transitions. Word has length 88 [2025-03-08 14:43:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:40,236 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 570 transitions. [2025-03-08 14:43:40,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 14:43:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 570 transitions. [2025-03-08 14:43:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 14:43:40,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:40,239 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:40,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:43:40,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:43:40,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:40,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2061328206, now seen corresponding path program 1 times [2025-03-08 14:43:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:43:40,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220695332] [2025-03-08 14:43:40,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:43:40,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:40,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:40,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:40,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:43:40,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491823584] [2025-03-08 14:43:40,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:40,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:43:40,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:43:40,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:43:40,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:43:40,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:40,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:40,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:40,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:40,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 14:43:40,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-08 14:43:41,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:43:41,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:43:41,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220695332] [2025-03-08 14:43:41,345 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:43:41,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491823584] [2025-03-08 14:43:41,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491823584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:43:41,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:43:41,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-08 14:43:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615025359] [2025-03-08 14:43:41,345 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:43:41,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 14:43:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:43:41,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 14:43:41,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:43:41,346 INFO L87 Difference]: Start difference. First operand 440 states and 570 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 14:43:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:41,837 INFO L93 Difference]: Finished difference Result 857 states and 1122 transitions. [2025-03-08 14:43:41,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 14:43:41,837 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2025-03-08 14:43:41,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:41,841 INFO L225 Difference]: With dead ends: 857 [2025-03-08 14:43:41,841 INFO L226 Difference]: Without dead ends: 696 [2025-03-08 14:43:41,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-08 14:43:41,842 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:41,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 485 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 14:43:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-08 14:43:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 559. [2025-03-08 14:43:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 405 states have (on average 1.2222222222222223) internal successors, (495), 407 states have internal predecessors, (495), 112 states have call successors, (112), 41 states have call predecessors, (112), 41 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 14:43:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 719 transitions. [2025-03-08 14:43:41,889 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 719 transitions. Word has length 88 [2025-03-08 14:43:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:41,889 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 719 transitions. [2025-03-08 14:43:41,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 14:43:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 719 transitions. [2025-03-08 14:43:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 14:43:41,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:41,890 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:41,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 14:43:42,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:43:42,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:42,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1873199369, now seen corresponding path program 1 times [2025-03-08 14:43:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:43:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019965192] [2025-03-08 14:43:42,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:42,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:43:42,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 14:43:42,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 14:43:42,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:42,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:43:42,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101373721] [2025-03-08 14:43:42,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:42,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:43:42,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:43:42,138 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:43:42,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 14:43:42,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 14:43:42,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 14:43:42,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:42,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:43:42,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:43:42,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 14:43:42,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 14:43:42,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:42,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:43:42,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:43:42,270 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:43:42,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:43:42,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 14:43:42,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:43:42,475 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:42,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:43:42,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:43:42 BoogieIcfgContainer [2025-03-08 14:43:42,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:43:42,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:43:42,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:43:42,521 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:43:42,521 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:43:35" (3/4) ... [2025-03-08 14:43:42,523 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:43:42,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:43:42,524 INFO L158 Benchmark]: Toolchain (without parser) took 7701.69ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 134.2MB in the beginning and 147.5MB in the end (delta: -13.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2025-03-08 14:43:42,524 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:43:42,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.91ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 120.3MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:43:42,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.55ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 117.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:43:42,524 INFO L158 Benchmark]: Boogie Preprocessor took 29.35ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 112.6MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:43:42,524 INFO L158 Benchmark]: IcfgBuilder took 302.95ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 91.5MB in the end (delta: 21.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:43:42,525 INFO L158 Benchmark]: TraceAbstraction took 7132.37ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 91.1MB in the beginning and 147.5MB in the end (delta: -56.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:43:42,525 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 201.3MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:43:42,526 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.91ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 120.3MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.55ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 117.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.35ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 112.6MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 302.95ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 91.5MB in the end (delta: 21.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7132.37ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 91.1MB in the beginning and 147.5MB in the end (delta: -56.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 201.3MB. Free memory is still 147.5MB. 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 123, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] signed short int last_1_var_1_1 = 16; [L37] unsigned char last_1_var_1_6 = 10; [L38] unsigned char last_1_var_1_8 = 1; [L39] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L127] isInitial = 1 [L128] FCALL initially() [L129] int k_loop; [L130] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L130] COND TRUE k_loop < 1 [L131] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_6 = var_1_6 [L119] last_1_var_1_8 = var_1_8 [L120] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L96] var_1_5 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L97] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L100] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L101] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L101] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L104] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L104] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L105] var_1_12 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L107] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L108] var_1_15 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L109] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L111] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L112] var_1_20 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L114] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L132] RET updateVariables() [L133] CALL step() [L43] signed long int stepLocal_6 = last_1_var_1_1; [L44] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L45] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L46] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L49] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L54] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L57] COND TRUE var_1_5 >= -2 [L58] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L60] unsigned char stepLocal_4 = var_1_6; [L61] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L62] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L63] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L64] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L71] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L72] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L75] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L76] COND TRUE \read(var_1_19) [L77] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L83] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L84] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=254, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L85] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L92] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=254, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L133] RET step() [L134] CALL, EXPR property() [L123-L124] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 88 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 703 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 689 mSDsluCounter, 1975 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1467 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1138 IncrementalHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 508 mSDtfsCounter, 1138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 572 GetRequests, 462 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=559occurred in iteration=6, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 425 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 969 NumberOfCodeBlocks, 969 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 695 ConstructedInterpolants, 1 QuantifiedInterpolants, 3497 SizeOfPredicates, 15 NumberOfNonLiveVariables, 699 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 2007/2112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:43:42,548 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_50-1loop_file-42.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 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:43:44,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:43:44,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:43:44,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:43:44,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:43:44,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:43:44,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:43:44,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:43:44,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:43:44,364 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:43:44,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:43:44,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:43:44,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:43:44,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:43:44,365 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:43:44,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:43:44,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:43:44,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:43:44,371 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:43:44,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:43:44,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:43:44,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:43:44,372 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 -> 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 [2025-03-08 14:43:44,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:43:44,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:43:44,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:43:44,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:43:44,620 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:43:44,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2025-03-08 14:43:45,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d32b48d/f2ea7d4a18964b2cbbc2e04d767eb98b/FLAG3bb574dca [2025-03-08 14:43:45,980 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:43:45,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2025-03-08 14:43:45,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d32b48d/f2ea7d4a18964b2cbbc2e04d767eb98b/FLAG3bb574dca [2025-03-08 14:43:46,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d32b48d/f2ea7d4a18964b2cbbc2e04d767eb98b [2025-03-08 14:43:46,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:43:46,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:43:46,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:43:46,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:43:46,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:43:46,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43120689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46, skipping insertion in model container [2025-03-08 14:43:46,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:43:46,135 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_50-1loop_file-42.i[915,928] [2025-03-08 14:43:46,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:43:46,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:43:46,198 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_50-1loop_file-42.i[915,928] [2025-03-08 14:43:46,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:43:46,243 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:43:46,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46 WrapperNode [2025-03-08 14:43:46,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:43:46,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:43:46,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:43:46,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:43:46,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,286 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-08 14:43:46,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:43:46,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:43:46,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:43:46,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:43:46,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,316 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:43:46,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:43:46,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:43:46,338 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:43:46,338 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:43:46,343 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (1/1) ... [2025-03-08 14:43:46,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:43:46,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:43:46,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:43:46,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:43:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:43:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:43:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:43:46,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:43:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:43:46,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:43:46,444 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:43:46,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:43:46,756 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-08 14:43:46,756 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:43:46,762 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:43:46,762 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:43:46,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:43:46 BoogieIcfgContainer [2025-03-08 14:43:46,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:43:46,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:43:46,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:43:46,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:43:46,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:43:46" (1/3) ... [2025-03-08 14:43:46,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3b1a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:43:46, skipping insertion in model container [2025-03-08 14:43:46,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:46" (2/3) ... [2025-03-08 14:43:46,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3b1a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:43:46, skipping insertion in model container [2025-03-08 14:43:46,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:43:46" (3/3) ... [2025-03-08 14:43:46,769 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-42.i [2025-03-08 14:43:46,778 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:43:46,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-42.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:43:46,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:43:46,820 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;@6cdd3b40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:43:46,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:43:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 14:43:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 14:43:46,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:46,828 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:46,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:46,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:46,831 INFO L85 PathProgramCache]: Analyzing trace with hash -786945993, now seen corresponding path program 1 times [2025-03-08 14:43:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:43:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374044331] [2025-03-08 14:43:46,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:46,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:46,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:43:46,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:43:46,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:43:46,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 14:43:47,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 14:43:47,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:47,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:47,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 14:43:47,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 14:43:47,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:43:47,218 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:43:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374044331] [2025-03-08 14:43:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374044331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:43:47,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:43:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:43:47,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512148936] [2025-03-08 14:43:47,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:43:47,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:43:47,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:43:47,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:43:47,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:43:47,240 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:47,468 INFO L93 Difference]: Finished difference Result 154 states and 250 transitions. [2025-03-08 14:43:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:43:47,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-03-08 14:43:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:47,478 INFO L225 Difference]: With dead ends: 154 [2025-03-08 14:43:47,478 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 14:43:47,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:43:47,481 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 76 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:47,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 204 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:43:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 14:43:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2025-03-08 14:43:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 14:43:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2025-03-08 14:43:47,510 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 87 [2025-03-08 14:43:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:47,510 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2025-03-08 14:43:47,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2025-03-08 14:43:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 14:43:47,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:47,512 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:47,520 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-08 14:43:47,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:47,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:47,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1134774804, now seen corresponding path program 1 times [2025-03-08 14:43:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:43:47,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642665587] [2025-03-08 14:43:47,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:47,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:47,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:43:47,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:43:47,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:43:47,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:47,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:47,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:47,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:47,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:43:47,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 14:43:48,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:43:48,185 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:43:48,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642665587] [2025-03-08 14:43:48,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642665587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:43:48,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:43:48,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:43:48,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533203713] [2025-03-08 14:43:48,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:43:48,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:43:48,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:43:48,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:43:48,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:43:48,187 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:48,715 INFO L93 Difference]: Finished difference Result 211 states and 311 transitions. [2025-03-08 14:43:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:43:48,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-03-08 14:43:48,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:48,720 INFO L225 Difference]: With dead ends: 211 [2025-03-08 14:43:48,720 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 14:43:48,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:43:48,721 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 97 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:48,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 294 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 14:43:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 14:43:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 119. [2025-03-08 14:43:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 14:43:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2025-03-08 14:43:48,753 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 88 [2025-03-08 14:43:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:48,753 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2025-03-08 14:43:48,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2025-03-08 14:43:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 14:43:48,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:48,755 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:48,767 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 (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:43:48,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:48,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:48,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 372777005, now seen corresponding path program 1 times [2025-03-08 14:43:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:43:48,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38293233] [2025-03-08 14:43:48,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:48,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:48,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:43:48,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:43:48,962 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 (4)] Waiting until timeout for monitored process [2025-03-08 14:43:49,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:49,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:49,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:49,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:49,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 14:43:49,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 14:43:49,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:43:49,129 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:43:49,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38293233] [2025-03-08 14:43:49,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38293233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:43:49,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:43:49,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:43:49,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790824043] [2025-03-08 14:43:49,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:43:49,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:43:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:43:49,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:43:49,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:43:49,130 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:49,226 INFO L93 Difference]: Finished difference Result 209 states and 308 transitions. [2025-03-08 14:43:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:43:49,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-03-08 14:43:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:49,232 INFO L225 Difference]: With dead ends: 209 [2025-03-08 14:43:49,232 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 14:43:49,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:43:49,233 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:49,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:43:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 14:43:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-08 14:43:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 14:43:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-03-08 14:43:49,250 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 88 [2025-03-08 14:43:49,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:49,250 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-03-08 14:43:49,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-03-08 14:43:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 14:43:49,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:49,252 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:49,259 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 (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:43:49,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:49,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:49,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1434677458, now seen corresponding path program 1 times [2025-03-08 14:43:49,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:43:49,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135444968] [2025-03-08 14:43:49,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:49,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:49,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:43:49,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:43:49,459 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 (5)] Waiting until timeout for monitored process [2025-03-08 14:43:49,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:49,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:49,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:49,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:49,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 14:43:49,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 14:43:49,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:43:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-03-08 14:43:49,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:43:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135444968] [2025-03-08 14:43:49,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135444968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:43:49,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:43:49,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-08 14:43:49,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984333811] [2025-03-08 14:43:49,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:43:49,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 14:43:49,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:43:49,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 14:43:49,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 14:43:49,938 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:43:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:50,620 INFO L93 Difference]: Finished difference Result 276 states and 367 transitions. [2025-03-08 14:43:50,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 14:43:50,620 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 88 [2025-03-08 14:43:50,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:50,622 INFO L225 Difference]: With dead ends: 276 [2025-03-08 14:43:50,622 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 14:43:50,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 14:43:50,623 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 243 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:50,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 314 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 14:43:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 14:43:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 204. [2025-03-08 14:43:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 143 states have internal predecessors, (177), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:43:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 273 transitions. [2025-03-08 14:43:50,653 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 273 transitions. Word has length 88 [2025-03-08 14:43:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:50,654 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 273 transitions. [2025-03-08 14:43:50,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:43:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 273 transitions. [2025-03-08 14:43:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 14:43:50,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:50,657 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:50,664 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 (5)] Forceful destruction successful, exit code 0 [2025-03-08 14:43:50,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:50,857 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:50,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:50,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1940236083, now seen corresponding path program 1 times [2025-03-08 14:43:50,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:43:50,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811684747] [2025-03-08 14:43:50,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:50,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:50,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:43:50,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:43:50,862 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 (6)] Waiting until timeout for monitored process [2025-03-08 14:43:50,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:50,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:50,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:50,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:50,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 14:43:50,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-08 14:43:51,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:43:51,505 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:43:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811684747] [2025-03-08 14:43:51,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811684747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:43:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [927928939] [2025-03-08 14:43:51,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:51,506 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 14:43:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 14:43:51,508 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 14:43:51,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-08 14:43:51,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:51,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:51,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:51,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:51,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 14:43:51,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 14:43:52,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:43:52,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [927928939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:43:52,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:43:52,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-08 14:43:52,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343218298] [2025-03-08 14:43:52,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:43:52,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 14:43:52,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:43:52,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 14:43:52,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 14:43:52,082 INFO L87 Difference]: Start difference. First operand 204 states and 273 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:53,239 INFO L93 Difference]: Finished difference Result 586 states and 779 transitions. [2025-03-08 14:43:53,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 14:43:53,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-03-08 14:43:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:53,246 INFO L225 Difference]: With dead ends: 586 [2025-03-08 14:43:53,246 INFO L226 Difference]: Without dead ends: 481 [2025-03-08 14:43:53,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:43:53,247 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:53,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 334 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 14:43:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-08 14:43:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 408. [2025-03-08 14:43:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 296 states have (on average 1.25) internal successors, (370), 298 states have internal predecessors, (370), 88 states have call successors, (88), 23 states have call predecessors, (88), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 14:43:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 546 transitions. [2025-03-08 14:43:53,284 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 546 transitions. Word has length 88 [2025-03-08 14:43:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:53,285 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 546 transitions. [2025-03-08 14:43:53,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 546 transitions. [2025-03-08 14:43:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 14:43:53,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:53,286 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:53,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-08 14:43:53,492 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 (6)] Ended with exit code 0 [2025-03-08 14:43:53,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:53,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:53,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:53,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2061328206, now seen corresponding path program 1 times [2025-03-08 14:43:53,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:43:53,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429532818] [2025-03-08 14:43:53,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:53,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:43:53,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:43:53,690 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 (8)] Waiting until timeout for monitored process [2025-03-08 14:43:53,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:53,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:53,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:53,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:53,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 14:43:53,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-08 14:43:54,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:43:54,338 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:43:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429532818] [2025-03-08 14:43:54,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429532818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:43:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1839758963] [2025-03-08 14:43:54,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:54,338 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 14:43:54,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 14:43:54,340 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 14:43:54,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-08 14:43:54,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 14:43:54,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 14:43:54,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:54,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:54,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 14:43:54,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 14:43:55,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:43:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1839758963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:43:55,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:43:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-08 14:43:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395146852] [2025-03-08 14:43:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:43:55,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:43:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:43:55,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:43:55,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 14:43:55,026 INFO L87 Difference]: Start difference. First operand 408 states and 546 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:43:55,949 INFO L93 Difference]: Finished difference Result 714 states and 956 transitions. [2025-03-08 14:43:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:43:55,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-03-08 14:43:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:43:55,956 INFO L225 Difference]: With dead ends: 714 [2025-03-08 14:43:55,958 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 14:43:55,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:43:55,960 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 66 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 14:43:55,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 278 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 14:43:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 14:43:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 511. [2025-03-08 14:43:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 369 states have (on average 1.2439024390243902) internal successors, (459), 371 states have internal predecessors, (459), 112 states have call successors, (112), 29 states have call predecessors, (112), 29 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 14:43:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 683 transitions. [2025-03-08 14:43:56,010 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 683 transitions. Word has length 88 [2025-03-08 14:43:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:43:56,010 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 683 transitions. [2025-03-08 14:43:56,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 14:43:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 683 transitions. [2025-03-08 14:43:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 14:43:56,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:43:56,012 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:43:56,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2025-03-08 14:43:56,217 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 (8)] Forceful destruction successful, exit code 0 [2025-03-08 14:43:56,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:56,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:43:56,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:43:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1873199369, now seen corresponding path program 1 times [2025-03-08 14:43:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:43:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022873294] [2025-03-08 14:43:56,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:56,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:43:56,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:43:56,416 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:43:56,417 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 (10)] Waiting until timeout for monitored process [2025-03-08 14:43:56,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 14:43:56,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 14:43:56,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:56,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:56,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 14:43:56,527 INFO L279 TraceCheckSpWp]: Computing forward predicates...