./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.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 e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:58:29,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:58:29,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:58:29,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:58:29,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:58:29,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:58:29,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:58:29,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:58:29,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:58:29,681 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:58:29,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:58:29,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:58:29,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:58:29,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:58:29,683 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:58:29,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:58:29,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:58:29,683 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:58:29,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:58:29,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:58:29,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:58:29,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:58:29,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:58:29,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:58:29,684 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:58:29,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:58:29,684 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:58:29,684 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:58:29,684 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:58:29,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:58:29,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:58:29,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:58:29,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:58:29,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:58:29,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:58:29,685 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:58:29,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:58:29,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:58:29,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:58:29,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:58:29,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:58:29,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:58:29,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:58:29,686 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 -> e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 [2025-03-17 02:58:29,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:58:29,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:58:29,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:58:29,925 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:58:29,925 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:58:29,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2025-03-17 02:58:31,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89caf59a8/87cf42edd7064b8099ec1a31717e2d76/FLAG13dd05be4 [2025-03-17 02:58:31,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:58:31,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2025-03-17 02:58:31,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89caf59a8/87cf42edd7064b8099ec1a31717e2d76/FLAG13dd05be4 [2025-03-17 02:58:31,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89caf59a8/87cf42edd7064b8099ec1a31717e2d76 [2025-03-17 02:58:31,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:58:31,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:58:31,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:58:31,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:58:31,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:58:31,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31, skipping insertion in model container [2025-03-17 02:58:31,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:58:31,688 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_floatingpointinfluence_no-floats_file-78.i[916,929] [2025-03-17 02:58:31,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:58:31,717 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:58:31,727 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_floatingpointinfluence_no-floats_file-78.i[916,929] [2025-03-17 02:58:31,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:58:31,758 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:58:31,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31 WrapperNode [2025-03-17 02:58:31,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:58:31,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:58:31,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:58:31,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:58:31,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,791 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-17 02:58:31,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:58:31,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:58:31,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:58:31,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:58:31,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,821 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:58:31,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:58:31,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:58:31,836 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:58:31,836 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:58:31,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (1/1) ... [2025-03-17 02:58:31,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:58:31,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:58:31,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:58:31,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:58:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:58:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:58:31,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:58:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:58:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:58:31,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:58:31,933 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:58:31,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:58:32,125 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:58:32,125 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:58:32,136 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:58:32,138 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:58:32,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:32 BoogieIcfgContainer [2025-03-17 02:58:32,138 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:58:32,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:58:32,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:58:32,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:58:32,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:58:31" (1/3) ... [2025-03-17 02:58:32,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738e5e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:32, skipping insertion in model container [2025-03-17 02:58:32,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:31" (2/3) ... [2025-03-17 02:58:32,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738e5e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:32, skipping insertion in model container [2025-03-17 02:58:32,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:32" (3/3) ... [2025-03-17 02:58:32,146 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i [2025-03-17 02:58:32,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:58:32,157 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-78.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:58:32,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:58:32,207 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;@2ee44be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:58:32,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:58:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:58:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:58:32,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:32,216 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:58:32,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:32,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash -45731315, now seen corresponding path program 1 times [2025-03-17 02:58:32,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:32,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786161675] [2025-03-17 02:58:32,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:32,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:32,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:32,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:32,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 02:58:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786161675] [2025-03-17 02:58:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786161675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:58:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274419495] [2025-03-17 02:58:32,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:32,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:58:32,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:58:32,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:58:32,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:58:32,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:32,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:32,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:32,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:32,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:58:32,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:58:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 02:58:32,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:58:32,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274419495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:32,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:58:32,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:58:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730985960] [2025-03-17 02:58:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:32,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:58:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:32,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:58:32,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:58:32,509 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:58:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:32,524 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2025-03-17 02:58:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:58:32,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2025-03-17 02:58:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:32,529 INFO L225 Difference]: With dead ends: 81 [2025-03-17 02:58:32,529 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 02:58:32,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:58:32,534 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:32,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:58:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 02:58:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 02:58:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:58:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2025-03-17 02:58:32,562 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 88 [2025-03-17 02:58:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:32,562 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2025-03-17 02:58:32,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:58:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2025-03-17 02:58:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:58:32,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:32,564 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:58:32,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:58:32,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:58:32,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:32,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash -48593235, now seen corresponding path program 1 times [2025-03-17 02:58:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:32,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948313281] [2025-03-17 02:58:32,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:32,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:32,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:32,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:32,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:58:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948313281] [2025-03-17 02:58:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948313281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:33,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:58:33,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:58:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564336615] [2025-03-17 02:58:33,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:33,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:58:33,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:33,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:58:33,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:58:33,070 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:58:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:33,124 INFO L93 Difference]: Finished difference Result 118 states and 175 transitions. [2025-03-17 02:58:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:58:33,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2025-03-17 02:58:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:33,126 INFO L225 Difference]: With dead ends: 118 [2025-03-17 02:58:33,126 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 02:58:33,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-17 02:58:33,127 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 28 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:33,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 160 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:58:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 02:58:33,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-03-17 02:58:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 02:58:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2025-03-17 02:58:33,139 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 88 [2025-03-17 02:58:33,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:33,140 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2025-03-17 02:58:33,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:58:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2025-03-17 02:58:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:58:33,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:33,142 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:58:33,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:58:33,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:33,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash -48563444, now seen corresponding path program 1 times [2025-03-17 02:58:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:33,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213465796] [2025-03-17 02:58:33,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:33,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:33,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:33,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:33,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:33,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:58:34,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:34,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213465796] [2025-03-17 02:58:34,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213465796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:34,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:58:34,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:58:34,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724961754] [2025-03-17 02:58:34,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:34,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:58:34,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:34,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:58:34,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:58:34,416 INFO L87 Difference]: Start difference. First operand 76 states and 112 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:58:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:34,823 INFO L93 Difference]: Finished difference Result 145 states and 197 transitions. [2025-03-17 02:58:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:58:34,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2025-03-17 02:58:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:34,826 INFO L225 Difference]: With dead ends: 145 [2025-03-17 02:58:34,826 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 02:58:34,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:58:34,827 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 128 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:34,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 304 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:58:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 02:58:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119. [2025-03-17 02:58:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:58:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions. [2025-03-17 02:58:34,858 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 88 [2025-03-17 02:58:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:34,858 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 170 transitions. [2025-03-17 02:58:34,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:58:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2025-03-17 02:58:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:58:34,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:34,859 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:58:34,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:58:34,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:34,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:34,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1856017907, now seen corresponding path program 1 times [2025-03-17 02:58:34,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:34,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-03-17 02:58:34,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:34,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:34,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:34,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:34,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:34,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:58:34,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:58:34,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:34,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:34,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:34,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:58:34,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:58:34,951 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:58:34,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:58:34,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:58:34,954 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 02:58:35,008 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:58:35,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:58:35 BoogieIcfgContainer [2025-03-17 02:58:35,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:58:35,011 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:58:35,011 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:58:35,012 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:58:35,012 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:32" (3/4) ... [2025-03-17 02:58:35,013 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:58:35,014 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:58:35,015 INFO L158 Benchmark]: Toolchain (without parser) took 3421.39ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 106.5MB in the beginning and 187.1MB in the end (delta: -80.5MB). Peak memory consumption was 118.1MB. Max. memory is 16.1GB. [2025-03-17 02:58:35,015 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:58:35,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.42ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:58:35,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.44ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:58:35,015 INFO L158 Benchmark]: Boogie Preprocessor took 41.29ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:58:35,015 INFO L158 Benchmark]: IcfgBuilder took 302.45ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 75.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:58:35,016 INFO L158 Benchmark]: TraceAbstraction took 2870.29ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 73.9MB in the beginning and 187.1MB in the end (delta: -113.2MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2025-03-17 02:58:35,016 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 343.9MB. Free memory was 187.1MB in the beginning and 187.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:58:35,017 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.12ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.42ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.44ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.29ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 302.45ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 75.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2870.29ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 73.9MB in the beginning and 187.1MB in the end (delta: -113.2MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 343.9MB. Free memory was 187.1MB in the beginning and 187.1MB in the end (delta: 41.6kB). 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 to_int at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 36, overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_9 = 100; [L26] signed long int var_1_10 = 4; [L27] signed long int var_1_11 = 128; [L28] signed long int var_1_12 = 128; [L29] signed long int var_1_13 = 0; [L30] signed long int var_1_14 = 127; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L67] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L67] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L68] var_1_3 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L70] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L70] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L71] var_1_10 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L72] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L73] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L73] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=2, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L74] var_1_11 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L75] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L76] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L76] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L77] var_1_13 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L78] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L79] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L79] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L80] var_1_14 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L81] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L82] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L82] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L83] var_1_16 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L84] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L85] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L85] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L98] RET updateVariables() [L99] CALL step() [L36] COND FALSE !(0.8f > (- var_1_10)) VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L39] unsigned char stepLocal_1 = var_1_15 > var_1_15; [L40] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L41] COND FALSE !(var_1_2 && stepLocal_0) VAL [isInitial=1, stepLocal_1=0, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=100] [L48] COND TRUE \read(var_1_2) [L49] var_1_9 = (var_1_10 - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=1] [L57] signed long int stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-200, var_1_10=2, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=1] [L58] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L61] var_1_12 = ((var_1_13 - var_1_14) - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_10=2, var_1_11=1, var_1_12=-1, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=1] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_15 > var_1_15)) ? (var_1_1 == ((signed long int) (var_1_15 - var_1_15))) : (var_1_1 == ((signed long int) ((var_1_15 + 5) - var_1_15)))) : 1) && (var_1_2 ? (var_1_9 == ((signed long int) (var_1_10 - var_1_11))) : ((var_1_1 < var_1_15) ? (var_1_9 == ((signed long int) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))) : (var_1_9 == ((signed long int) var_1_10))))) && ((var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (var_1_12 == ((signed long int) (var_1_10 - 99.5))) : (var_1_12 == ((signed long int) ((var_1_13 - var_1_14) - var_1_11))))) && ((0.8f > (- var_1_10)) ? (var_1_15 == ((unsigned char) var_1_16)) : 1) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=-1, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=1, var_1_12=-1, var_1_13=2147483647, var_1_14=2147483647, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 77 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 523 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 324 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 199 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=3, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1430/1456 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:58:35,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_floatingpointinfluence_no-floats_file-78.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 e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:58:36,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:58:36,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:58:36,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:58:36,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:58:36,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:58:36,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:58:36,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:58:36,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:58:36,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:58:36,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:58:36,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:58:36,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:58:36,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:58:36,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:58:36,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:58:36,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:58:36,871 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:58:36,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:58:36,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:58:36,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:58:36,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:58:36,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:58:36,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:58:36,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:58:36,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:58:36,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:58:36,871 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:58:36,871 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:58:36,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:58:36,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:58:36,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:58:36,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:58:36,872 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 -> e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 [2025-03-17 02:58:37,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:58:37,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:58:37,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:58:37,101 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:58:37,101 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:58:37,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2025-03-17 02:58:38,263 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ed7dc1b/1925739c5764494a98805861f0d9273b/FLAGaca903c7e [2025-03-17 02:58:38,493 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:58:38,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2025-03-17 02:58:38,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ed7dc1b/1925739c5764494a98805861f0d9273b/FLAGaca903c7e [2025-03-17 02:58:38,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ed7dc1b/1925739c5764494a98805861f0d9273b [2025-03-17 02:58:38,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:58:38,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:58:38,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:58:38,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:58:38,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:58:38,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efc5768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38, skipping insertion in model container [2025-03-17 02:58:38,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:58:38,654 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_floatingpointinfluence_no-floats_file-78.i[916,929] [2025-03-17 02:58:38,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:58:38,702 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:58:38,710 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_floatingpointinfluence_no-floats_file-78.i[916,929] [2025-03-17 02:58:38,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:58:38,733 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:58:38,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38 WrapperNode [2025-03-17 02:58:38,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:58:38,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:58:38,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:58:38,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:58:38,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,764 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-03-17 02:58:38,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:58:38,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:58:38,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:58:38,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:58:38,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,789 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:58:38,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:58:38,806 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:58:38,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:58:38,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:58:38,807 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (1/1) ... [2025-03-17 02:58:38,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:58:38,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:58:38,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:58:38,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:58:38,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:58:38,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:58:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:58:38,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:58:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:58:38,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:58:38,918 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:58:38,919 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:58:40,783 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:58:40,783 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:58:40,790 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:58:40,790 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:58:40,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:40 BoogieIcfgContainer [2025-03-17 02:58:40,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:58:40,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:58:40,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:58:40,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:58:40,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:58:38" (1/3) ... [2025-03-17 02:58:40,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d42dc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:40, skipping insertion in model container [2025-03-17 02:58:40,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:38" (2/3) ... [2025-03-17 02:58:40,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d42dc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:40, skipping insertion in model container [2025-03-17 02:58:40,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:40" (3/3) ... [2025-03-17 02:58:40,803 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i [2025-03-17 02:58:40,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:58:40,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-78.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:58:40,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:58:40,856 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;@d775966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:58:40,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:58:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:58:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:58:40,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:40,864 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:58:40,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:40,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash -45731315, now seen corresponding path program 1 times [2025-03-17 02:58:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:58:40,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772559724] [2025-03-17 02:58:40,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:40,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:58:40,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:58:40,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:58:40,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:58:40,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:41,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:41,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:41,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:41,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:58:41,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:58:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-17 02:58:41,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:58:41,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:58:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772559724] [2025-03-17 02:58:41,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772559724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:41,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:58:41,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:58:41,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995569157] [2025-03-17 02:58:41,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:41,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:58:41,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:58:41,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:58:41,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:58:41,097 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:58:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:41,115 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2025-03-17 02:58:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:58:41,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2025-03-17 02:58:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:41,121 INFO L225 Difference]: With dead ends: 81 [2025-03-17 02:58:41,121 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 02:58:41,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:58:41,127 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:41,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:58:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 02:58:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 02:58:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:58:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2025-03-17 02:58:41,162 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 88 [2025-03-17 02:58:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:41,162 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2025-03-17 02:58:41,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:58:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2025-03-17 02:58:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:58:41,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:41,165 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:58:41,174 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-17 02:58:41,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:58:41,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:41,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash -48593235, now seen corresponding path program 1 times [2025-03-17 02:58:41,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:58:41,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33093990] [2025-03-17 02:58:41,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:41,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:58:41,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:58:41,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:58:41,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:58:41,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:41,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:41,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:41,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:41,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 02:58:41,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:58:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:58:41,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:58:41,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:58:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33093990] [2025-03-17 02:58:41,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33093990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:41,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:58:41,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:58:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279347870] [2025-03-17 02:58:41,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:41,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:58:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:58:41,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:58:41,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:58:41,869 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:58:44,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:58:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:44,305 INFO L93 Difference]: Finished difference Result 118 states and 175 transitions. [2025-03-17 02:58:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:58:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2025-03-17 02:58:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:44,329 INFO L225 Difference]: With dead ends: 118 [2025-03-17 02:58:44,329 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 02:58:44,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-17 02:58:44,330 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 11 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:44,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 160 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 02:58:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 02:58:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-03-17 02:58:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 02:58:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2025-03-17 02:58:44,348 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 88 [2025-03-17 02:58:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:44,348 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2025-03-17 02:58:44,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:58:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2025-03-17 02:58:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:58:44,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:44,350 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:58:44,358 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 (3)] Ended with exit code 0 [2025-03-17 02:58:44,550 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-17 02:58:44,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:44,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:44,551 INFO L85 PathProgramCache]: Analyzing trace with hash -48563444, now seen corresponding path program 1 times [2025-03-17 02:58:44,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:58:44,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873191945] [2025-03-17 02:58:44,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:44,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:58:44,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:58:44,553 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-17 02:58:44,554 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-17 02:58:44,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:44,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:44,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:44,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:58:44,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:58:44,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:44,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:44,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:44,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:58:44,780 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2025-03-17 02:58:44,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [874125800] [2025-03-17 02:58:44,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:44,780 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 02:58:44,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 02:58:44,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 02:58:44,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-17 02:58:44,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:58:44,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:58:44,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:44,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:44,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:58:44,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:59:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:59:17,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:59:17,167 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:59:17,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873191945] [2025-03-17 02:59:17,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 02:59:17,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [874125800] [2025-03-17 02:59:17,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [874125800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:17,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:17,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:59:17,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996999815] [2025-03-17 02:59:17,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:17,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:59:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:59:17,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:59:17,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:59:17,169 INFO L87 Difference]: Start difference. First operand 76 states and 112 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:59:27,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:59:31,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:59:33,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:59:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:37,623 INFO L93 Difference]: Finished difference Result 117 states and 160 transitions. [2025-03-17 02:59:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:59:37,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2025-03-17 02:59:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:37,638 INFO L225 Difference]: With dead ends: 117 [2025-03-17 02:59:37,638 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 02:59:37,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:59:37,638 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 55 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:37,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 215 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 18.3s Time] [2025-03-17 02:59:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 02:59:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2025-03-17 02:59:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 70 states have internal predecessors, (82), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 02:59:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2025-03-17 02:59:37,654 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 88 [2025-03-17 02:59:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:37,654 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2025-03-17 02:59:37,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:59:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2025-03-17 02:59:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:59:37,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:37,656 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:59:37,667 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 (4)] Ended with exit code 0 [2025-03-17 02:59:37,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-17 02:59:38,056 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 02:59:38,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:38,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1856017907, now seen corresponding path program 1 times [2025-03-17 02:59:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:59:38,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062070429] [2025-03-17 02:59:38,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:38,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:59:38,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:59:38,059 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-17 02:59:38,060 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-17 02:59:38,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:59:38,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:59:38,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:38,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:38,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 02:59:38,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:59:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-17 02:59:38,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:59:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 02:59:44,873 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:59:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062070429] [2025-03-17 02:59:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062070429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:59:44,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 02:59:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-17 02:59:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049038379] [2025-03-17 02:59:44,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 02:59:44,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:59:44,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:59:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:59:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:59:44,874 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-17 02:59:49,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:59:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:49,516 INFO L93 Difference]: Finished difference Result 220 states and 301 transitions. [2025-03-17 02:59:49,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:59:49,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 88 [2025-03-17 02:59:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:49,548 INFO L225 Difference]: With dead ends: 220 [2025-03-17 02:59:49,548 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 02:59:49,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:59:49,550 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 63 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:49,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 78 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 02:59:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 02:59:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2025-03-17 02:59:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 67 states have internal predecessors, (74), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 02:59:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 142 transitions. [2025-03-17 02:59:49,568 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 142 transitions. Word has length 88 [2025-03-17 02:59:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:49,569 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 142 transitions. [2025-03-17 02:59:49,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-17 02:59:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 142 transitions. [2025-03-17 02:59:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 02:59:49,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:49,571 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:59:49,578 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-17 02:59:49,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-17 02:59:49,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:49,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 331322044, now seen corresponding path program 1 times [2025-03-17 02:59:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:59:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140616702] [2025-03-17 02:59:49,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:49,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:59:49,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:59:49,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:59:49,776 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 (7)] Waiting until timeout for monitored process [2025-03-17 02:59:49,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:59:49,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:59:49,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:49,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:49,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 02:59:49,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:59:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:59:49,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:59:49,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:59:49,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140616702] [2025-03-17 02:59:49,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140616702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:49,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:49,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:59:49,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671037259] [2025-03-17 02:59:49,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:49,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:59:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:59:49,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:59:49,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:59:49,892 INFO L87 Difference]: Start difference. First operand 106 states and 142 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:59:50,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:59:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:50,944 INFO L93 Difference]: Finished difference Result 154 states and 210 transitions. [2025-03-17 02:59:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:59:50,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2025-03-17 02:59:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:50,970 INFO L225 Difference]: With dead ends: 154 [2025-03-17 02:59:50,970 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 02:59:50,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 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-17 02:59:50,971 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:50,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 02:59:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 02:59:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2025-03-17 02:59:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.123076923076923) internal successors, (73), 67 states have internal predecessors, (73), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 02:59:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 141 transitions. [2025-03-17 02:59:50,982 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 141 transitions. Word has length 89 [2025-03-17 02:59:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:50,982 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 141 transitions. [2025-03-17 02:59:50,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:59:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2025-03-17 02:59:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 02:59:50,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:50,983 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:59:50,992 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 (7)] Ended with exit code 0 [2025-03-17 02:59:51,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:59:51,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:51,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:51,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1218825725, now seen corresponding path program 1 times [2025-03-17 02:59:51,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:59:51,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369830165] [2025-03-17 02:59:51,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:51,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:59:51,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:59:51,186 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-17 02:59:51,188 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-17 02:59:51,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:59:51,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:59:51,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:51,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:59:51,292 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:59:51,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:59:51,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:59:51,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:51,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:59:51,382 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2025-03-17 02:59:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1632627180] [2025-03-17 02:59:51,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:51,383 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 02:59:51,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 02:59:51,385 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-17 02:59:51,386 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-17 02:59:51,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:59:51,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:59:51,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:51,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:51,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 02:59:51,529 INFO L279 TraceCheckSpWp]: Computing forward predicates...