./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.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 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:43:57,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:43:57,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:43:57,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:43:57,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:43:57,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:43:57,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:43:57,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:43:57,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:43:57,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:43:57,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:43:57,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:43:57,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:43:57,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:43:57,315 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:43:57,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:43:57,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:43:57,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:43:57,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:43:57,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:43:57,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:43:57,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:43:57,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:43:57,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:43:57,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:43:57,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:43:57,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:43:57,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:43:57,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:43:57,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:43:57,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:43:57,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:43:57,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:43:57,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:43:57,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:43:57,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:43:57,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:43:57,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:43:57,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:43:57,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:43:57,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:43:57,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:43:57,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:43:57,318 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 -> 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 [2025-03-08 13:43:57,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:43:57,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:43:57,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:43:57,555 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:43:57,555 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:43:57,556 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-13.i [2025-03-08 13:43:58,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed2cf1da/abec084cd93e4e2aa0cdc5cb782aefdd/FLAG1bba3cafe [2025-03-08 13:43:58,942 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:43:58,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i [2025-03-08 13:43:58,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed2cf1da/abec084cd93e4e2aa0cdc5cb782aefdd/FLAG1bba3cafe [2025-03-08 13:43:59,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed2cf1da/abec084cd93e4e2aa0cdc5cb782aefdd [2025-03-08 13:43:59,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:43:59,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:43:59,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:43:59,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:43:59,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:43:59,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9500ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59, skipping insertion in model container [2025-03-08 13:43:59,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:43:59,399 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-13.i[916,929] [2025-03-08 13:43:59,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:43:59,450 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:43:59,459 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-13.i[916,929] [2025-03-08 13:43:59,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:43:59,487 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:43:59,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59 WrapperNode [2025-03-08 13:43:59,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:43:59,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:43:59,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:43:59,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:43:59,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,525 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-08 13:43:59,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:43:59,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:43:59,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:43:59,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:43:59,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,557 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:43:59,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:43:59,568 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:43:59,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:43:59,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:43:59,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (1/1) ... [2025-03-08 13:43:59,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:43:59,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:43:59,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:43:59,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:43:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:43:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:43:59,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:43:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:43:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:43:59,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:43:59,655 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:43:59,656 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:43:59,819 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 13:43:59,819 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:43:59,826 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:43:59,827 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:43:59,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:43:59 BoogieIcfgContainer [2025-03-08 13:43:59,827 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:43:59,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:43:59,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:43:59,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:43:59,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:43:59" (1/3) ... [2025-03-08 13:43:59,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca33e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:43:59, skipping insertion in model container [2025-03-08 13:43:59,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:59" (2/3) ... [2025-03-08 13:43:59,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca33e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:43:59, skipping insertion in model container [2025-03-08 13:43:59,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:43:59" (3/3) ... [2025-03-08 13:43:59,834 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-13.i [2025-03-08 13:43:59,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:43:59,844 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-13.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:43:59,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:43:59,888 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;@59548f48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:43:59,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:43:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 13:43:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 13:43:59,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:43:59,898 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:43:59,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:43:59,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:43:59,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1169412541, now seen corresponding path program 1 times [2025-03-08 13:43:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:43:59,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135298037] [2025-03-08 13:43:59,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:43:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:43:59,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 13:43:59,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 13:43:59,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:43:59,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 13:44:00,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:00,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135298037] [2025-03-08 13:44:00,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135298037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:44:00,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496520213] [2025-03-08 13:44:00,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:00,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:44:00,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:00,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:44:00,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:44:00,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 13:44:00,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 13:44:00,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:00,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:00,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:44:00,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 13:44:00,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:44:00,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496520213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:00,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:44:00,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:44:00,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280391116] [2025-03-08 13:44:00,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:00,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:44:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:00,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:44:00,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:00,280 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 13:44:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:00,297 INFO L93 Difference]: Finished difference Result 98 states and 168 transitions. [2025-03-08 13:44:00,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:44:00,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2025-03-08 13:44:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:00,303 INFO L225 Difference]: With dead ends: 98 [2025-03-08 13:44:00,303 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 13:44:00,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:00,309 INFO L435 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:00,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:44:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 13:44:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 13:44:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 13:44:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-03-08 13:44:00,339 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 118 [2025-03-08 13:44:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:00,339 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-03-08 13:44:00,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 13:44:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-03-08 13:44:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 13:44:00,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:00,342 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:00,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:44:00,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:44:00,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:00,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1154534775, now seen corresponding path program 1 times [2025-03-08 13:44:00,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:00,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095742297] [2025-03-08 13:44:00,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:00,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 13:44:00,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 13:44:00,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:00,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 13:44:01,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095742297] [2025-03-08 13:44:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095742297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:01,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:01,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 13:44:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831113902] [2025-03-08 13:44:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:01,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:44:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:01,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:44:01,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:44:01,960 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 13:44:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:02,224 INFO L93 Difference]: Finished difference Result 126 states and 173 transitions. [2025-03-08 13:44:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 13:44:02,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-03-08 13:44:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:02,227 INFO L225 Difference]: With dead ends: 126 [2025-03-08 13:44:02,227 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 13:44:02,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:44:02,228 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 111 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:02,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 513 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:44:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 13:44:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 100. [2025-03-08 13:44:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 13:44:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2025-03-08 13:44:02,250 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 119 [2025-03-08 13:44:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:02,250 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2025-03-08 13:44:02,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 13:44:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2025-03-08 13:44:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 13:44:02,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:02,252 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:02,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:44:02,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:02,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1153611254, now seen corresponding path program 1 times [2025-03-08 13:44:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:02,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599799681] [2025-03-08 13:44:02,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:02,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 13:44:02,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 13:44:02,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:02,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 13:44:03,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:03,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599799681] [2025-03-08 13:44:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599799681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:03,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:03,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:44:03,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269489500] [2025-03-08 13:44:03,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:03,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:44:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:03,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:44:03,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:44:03,166 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 13:44:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:03,388 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2025-03-08 13:44:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:44:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-03-08 13:44:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:03,390 INFO L225 Difference]: With dead ends: 124 [2025-03-08 13:44:03,390 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 13:44:03,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:44:03,390 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 115 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:03,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 523 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:44:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 13:44:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2025-03-08 13:44:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 13:44:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2025-03-08 13:44:03,405 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 119 [2025-03-08 13:44:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:03,406 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2025-03-08 13:44:03,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 13:44:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2025-03-08 13:44:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 13:44:03,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:03,409 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:03,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:44:03,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:03,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash 588275560, now seen corresponding path program 1 times [2025-03-08 13:44:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:03,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355821424] [2025-03-08 13:44:03,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:03,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 13:44:03,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 13:44:03,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:03,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 13:44:04,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:04,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355821424] [2025-03-08 13:44:04,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355821424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:04,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:04,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 13:44:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824100557] [2025-03-08 13:44:04,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:04,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:44:04,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:04,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:44:04,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:44:04,203 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 13:44:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:04,392 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2025-03-08 13:44:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 13:44:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-03-08 13:44:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:04,393 INFO L225 Difference]: With dead ends: 124 [2025-03-08 13:44:04,393 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 13:44:04,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:44:04,394 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 104 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:04,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 477 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:44:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 13:44:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2025-03-08 13:44:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 13:44:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-03-08 13:44:04,406 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 119 [2025-03-08 13:44:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:04,408 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-03-08 13:44:04,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 13:44:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-03-08 13:44:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 13:44:04,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:04,409 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:04,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:44:04,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:04,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash 589199081, now seen corresponding path program 1 times [2025-03-08 13:44:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:04,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739360162] [2025-03-08 13:44:04,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:04,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 13:44:04,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 13:44:04,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:04,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 13:44:05,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:05,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739360162] [2025-03-08 13:44:05,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739360162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:05,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:05,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:44:05,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094052428] [2025-03-08 13:44:05,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:05,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:44:05,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:05,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:44:05,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:44:05,465 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 13:44:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:05,737 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2025-03-08 13:44:05,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:44:05,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-03-08 13:44:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:05,738 INFO L225 Difference]: With dead ends: 105 [2025-03-08 13:44:05,738 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 13:44:05,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:44:05,740 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 64 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:05,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 491 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:44:05,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 13:44:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 13:44:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 13:44:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-03-08 13:44:05,744 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 119 [2025-03-08 13:44:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:05,744 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-08 13:44:05,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 13:44:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-03-08 13:44:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 13:44:05,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:05,745 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:05,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 13:44:05,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:05,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1351048280, now seen corresponding path program 1 times [2025-03-08 13:44:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:05,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391546065] [2025-03-08 13:44:05,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:05,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 13:44:05,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 13:44:05,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:05,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:44:05,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289055622] [2025-03-08 13:44:05,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:05,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:44:05,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:05,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:44:05,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:44:05,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 13:44:05,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 13:44:05,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:05,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:44:05,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:44:05,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 13:44:05,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 13:44:05,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:05,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:44:05,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:44:05,987 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:44:05,988 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:44:05,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 13:44:06,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 13:44:06,192 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 13:44:06,243 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:44:06,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:44:06 BoogieIcfgContainer [2025-03-08 13:44:06,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:44:06,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:44:06,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:44:06,247 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:44:06,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:43:59" (3/4) ... [2025-03-08 13:44:06,249 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:44:06,250 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:44:06,251 INFO L158 Benchmark]: Toolchain (without parser) took 6971.89ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 113.4MB in the beginning and 127.6MB in the end (delta: -14.1MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. [2025-03-08 13:44:06,251 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:44:06,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.99ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 100.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:44:06,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.37ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:44:06,251 INFO L158 Benchmark]: Boogie Preprocessor took 33.41ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:44:06,252 INFO L158 Benchmark]: IcfgBuilder took 259.44ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 79.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:44:06,252 INFO L158 Benchmark]: TraceAbstraction took 6417.50ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 78.6MB in the beginning and 127.6MB in the end (delta: -49.0MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. [2025-03-08 13:44:06,252 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 327.2MB. Free memory was 127.6MB in the beginning and 127.6MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:44:06,253 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.99ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 100.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.37ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.41ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 259.44ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 79.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6417.50ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 78.6MB in the beginning and 127.6MB in the end (delta: -49.0MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 327.2MB. Free memory was 127.6MB in the beginning and 127.6MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 25; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_5 = 16; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 4; [L27] unsigned short int var_1_8 = 2; [L28] signed char var_1_9 = 64; [L29] signed char var_1_10 = 0; [L30] unsigned char var_1_11 = 16; [L31] signed long int var_1_12 = 128; [L32] signed long int var_1_13 = 50; [L33] signed long int var_1_14 = 3; [L34] signed long int var_1_15 = 25; VAL [isInitial=0, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L63] var_1_6 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] CALL assume_abort_if_not(var_1_6 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L70] var_1_9 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L71] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L72] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L72] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L73] var_1_10 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L74] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L75] CALL assume_abort_if_not(var_1_10 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L75] RET assume_abort_if_not(var_1_10 <= 64) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L76] var_1_12 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L78] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L78] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L79] var_1_13 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L81] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L81] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L82] var_1_14 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L83] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L84] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L84] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L85] var_1_15 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L86] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L87] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L87] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L100] RET updateVariables() [L101] CALL step() [L38] COND FALSE !(((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L44] COND TRUE (var_1_1 == 16) || (var_1_11 < (10 / var_1_6)) [L45] var_1_5 = var_1_7 VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L49] unsigned char stepLocal_1 = var_1_11; [L50] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_1=16, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L51] COND TRUE stepLocal_0 || (var_1_11 >= var_1_11) VAL [isInitial=1, stepLocal_1=16, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L52] COND TRUE stepLocal_1 < ((var_1_9 - var_1_10) - 16) [L53] var_1_8 = ((((var_1_10) > (32)) ? (var_1_10) : (32))) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=65] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))))) : 1) && (((var_1_1 == 16) || (var_1_11 < (10 / var_1_6))) ? (var_1_5 == ((signed char) var_1_7)) : (var_1_5 == ((signed char) 5)))) && ((var_1_2 || (var_1_11 >= var_1_11)) ? ((var_1_11 < ((var_1_9 - var_1_10) - 16)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) > (32)) ? (var_1_10) : (32))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11))))))) && ((((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) ? (var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=65] [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=65] [L19] reach_error() VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 96 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 6, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 394 mSDsluCounter, 2075 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1523 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 534 IncrementalHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 552 mSDtfsCounter, 534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=4, InterpolantAutomatonStates: 36, 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, 5 MinimizatonAttempts, 65 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 950 NumberOfCodeBlocks, 950 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 706 ConstructedInterpolants, 0 QuantifiedInterpolants, 1547 SizeOfPredicates, 0 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 4068/4104 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:44:06,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.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 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:44:08,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:44:08,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:44:08,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:44:08,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:44:08,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:44:08,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:44:08,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:44:08,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:44:08,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:44:08,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:44:08,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:44:08,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:44:08,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:44:08,301 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:44:08,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:44:08,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:44:08,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:44:08,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:44:08,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:44:08,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:44:08,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:44:08,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:44:08,302 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:44:08,302 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:44:08,302 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:44:08,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:44:08,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:44:08,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:44:08,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:44:08,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:44:08,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:44:08,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:44:08,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:44:08,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:44:08,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:44:08,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:44:08,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:44:08,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:44:08,304 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:44:08,304 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:44:08,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:44:08,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:44:08,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:44:08,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:44:08,304 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 -> 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 [2025-03-08 13:44:08,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:44:08,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:44:08,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:44:08,557 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:44:08,558 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:44:08,560 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-13.i [2025-03-08 13:44:09,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b626314/46cd40fcbc654ea682d7baa68f740162/FLAG13da41fbd [2025-03-08 13:44:09,907 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:44:09,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i [2025-03-08 13:44:09,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b626314/46cd40fcbc654ea682d7baa68f740162/FLAG13da41fbd [2025-03-08 13:44:09,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b626314/46cd40fcbc654ea682d7baa68f740162 [2025-03-08 13:44:09,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:44:09,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:44:09,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:44:09,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:44:09,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:44:09,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:44:09" (1/1) ... [2025-03-08 13:44:09,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34928312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:09, skipping insertion in model container [2025-03-08 13:44:09,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:44:09" (1/1) ... [2025-03-08 13:44:09,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:44:10,055 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-13.i[916,929] [2025-03-08 13:44:10,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:44:10,111 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:44:10,120 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-13.i[916,929] [2025-03-08 13:44:10,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:44:10,151 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:44:10,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10 WrapperNode [2025-03-08 13:44:10,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:44:10,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:44:10,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:44:10,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:44:10,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,183 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2025-03-08 13:44:10,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:44:10,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:44:10,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:44:10,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:44:10,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,212 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:44:10,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:44:10,233 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:44:10,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:44:10,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:44:10,237 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (1/1) ... [2025-03-08 13:44:10,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:44:10,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:10,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:44:10,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:44:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:44:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:44:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:44:10,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:44:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:44:10,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:44:10,342 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:44:10,343 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:44:15,764 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 13:44:15,764 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:44:15,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:44:15,771 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:44:15,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:15 BoogieIcfgContainer [2025-03-08 13:44:15,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:44:15,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:44:15,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:44:15,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:44:15,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:44:09" (1/3) ... [2025-03-08 13:44:15,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecf43b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:44:15, skipping insertion in model container [2025-03-08 13:44:15,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:10" (2/3) ... [2025-03-08 13:44:15,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecf43b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:44:15, skipping insertion in model container [2025-03-08 13:44:15,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:15" (3/3) ... [2025-03-08 13:44:15,777 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-13.i [2025-03-08 13:44:15,786 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:44:15,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-13.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:44:15,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:44:15,845 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;@70869a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:44:15,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:44:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 13:44:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 13:44:15,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:15,856 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:15,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:15,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1169412541, now seen corresponding path program 1 times [2025-03-08 13:44:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:44:15,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122287772] [2025-03-08 13:44:15,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:15,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:15,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:44:15,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:44:15,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:44:15,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 13:44:16,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 13:44:16,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:16,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:16,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:44:16,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-08 13:44:16,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:44:16,093 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:44:16,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122287772] [2025-03-08 13:44:16,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122287772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:16,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:16,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:44:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738547390] [2025-03-08 13:44:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:16,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:44:16,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:44:16,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:44:16,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:16,111 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 13:44:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:16,142 INFO L93 Difference]: Finished difference Result 98 states and 168 transitions. [2025-03-08 13:44:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:44:16,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2025-03-08 13:44:16,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:16,147 INFO L225 Difference]: With dead ends: 98 [2025-03-08 13:44:16,147 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 13:44:16,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:16,151 INFO L435 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:16,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:44:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 13:44:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 13:44:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 13:44:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-03-08 13:44:16,179 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 118 [2025-03-08 13:44:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:16,180 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-03-08 13:44:16,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 13:44:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-03-08 13:44:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 13:44:16,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:16,186 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:16,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 13:44:16,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:16,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:16,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1154534775, now seen corresponding path program 1 times [2025-03-08 13:44:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:44:16,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898772655] [2025-03-08 13:44:16,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:16,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:16,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:44:16,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:44:16,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:44:16,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 13:44:16,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 13:44:16,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:16,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:16,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 13:44:16,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 13:44:16,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:44:16,671 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:44:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898772655] [2025-03-08 13:44:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898772655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:16,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:16,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:44:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110687310] [2025-03-08 13:44:16,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:16,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:44:16,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:44:16,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:44:16,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:44:16,672 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 13:44:18,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:44:19,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:44:21,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:44:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:21,830 INFO L93 Difference]: Finished difference Result 187 states and 275 transitions. [2025-03-08 13:44:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:44:21,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-03-08 13:44:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:21,850 INFO L225 Difference]: With dead ends: 187 [2025-03-08 13:44:21,851 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 13:44:21,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:44:21,852 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 157 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:21,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 206 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 13:44:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 13:44:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-08 13:44:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 76 states have internal predecessors, (90), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 13:44:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2025-03-08 13:44:21,873 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 119 [2025-03-08 13:44:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:21,873 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2025-03-08 13:44:21,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 13:44:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2025-03-08 13:44:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 13:44:21,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:21,874 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:21,882 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-08 13:44:22,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:22,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:22,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash 588275560, now seen corresponding path program 1 times [2025-03-08 13:44:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:44:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352749818] [2025-03-08 13:44:22,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:22,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:22,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:44:22,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:44:22,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:44:22,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 13:44:22,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 13:44:22,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:22,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:22,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 13:44:22,231 INFO L279 TraceCheckSpWp]: Computing forward predicates...