./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-43.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 13083d95d661542b4d69cfedb32ccc83a061059041df5cc86775c87ade99f3f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:24:31,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:24:31,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:24:31,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:24:31,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:24:31,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:24:31,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:24:31,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:24:31,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:24:31,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:24:31,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:24:31,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:24:31,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:24:31,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:24:31,979 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:24:31,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:24:31,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:24:31,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:24:31,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:24:31,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:24:31,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:24:31,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:24:31,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:24:31,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:24:31,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:24:31,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:24:31,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:24:31,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:24:31,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:24:31,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:24:31,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:24:31,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:24:31,982 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 -> 13083d95d661542b4d69cfedb32ccc83a061059041df5cc86775c87ade99f3f0 [2025-03-03 22:24:32,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:24:32,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:24:32,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:24:32,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:24:32,200 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:24:32,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-43.i [2025-03-03 22:24:33,379 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0d20d8f/b5f9a61265b64de38e9dd79c95f3067e/FLAG4784b575e [2025-03-03 22:24:33,603 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:24:33,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-43.i [2025-03-03 22:24:33,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0d20d8f/b5f9a61265b64de38e9dd79c95f3067e/FLAG4784b575e [2025-03-03 22:24:33,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0d20d8f/b5f9a61265b64de38e9dd79c95f3067e [2025-03-03 22:24:33,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:24:33,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:24:33,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:24:33,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:24:33,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:24:33,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:24:33" (1/1) ... [2025-03-03 22:24:33,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f6906a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:33, skipping insertion in model container [2025-03-03 22:24:33,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:24:33" (1/1) ... [2025-03-03 22:24:33,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:24:34,054 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_has-floats_file-43.i[917,930] [2025-03-03 22:24:34,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:24:34,100 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:24:34,106 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_has-floats_file-43.i[917,930] [2025-03-03 22:24:34,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:24:34,130 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:24:34,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34 WrapperNode [2025-03-03 22:24:34,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:24:34,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:24:34,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:24:34,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:24:34,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,167 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-03-03 22:24:34,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:24:34,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:24:34,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:24:34,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:24:34,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,195 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:24:34,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:24:34,217 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:24:34,217 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:24:34,217 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:24:34,218 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (1/1) ... [2025-03-03 22:24:34,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:24:34,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:24:34,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:24:34,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:24:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:24:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:24:34,269 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:24:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:24:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:24:34,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:24:34,319 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:24:34,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:24:34,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~bitwise18#1;havoc property_#t~short19#1;havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2025-03-03 22:24:34,535 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 22:24:34,535 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:24:34,552 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:24:34,555 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:24:34,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:24:34 BoogieIcfgContainer [2025-03-03 22:24:34,556 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:24:34,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:24:34,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:24:34,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:24:34,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:24:33" (1/3) ... [2025-03-03 22:24:34,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5f432a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:24:34, skipping insertion in model container [2025-03-03 22:24:34,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:34" (2/3) ... [2025-03-03 22:24:34,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5f432a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:24:34, skipping insertion in model container [2025-03-03 22:24:34,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:24:34" (3/3) ... [2025-03-03 22:24:34,563 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-43.i [2025-03-03 22:24:34,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:24:34,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-43.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:24:34,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:24:34,634 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;@3eeb2ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:24:34,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:24:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:24:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 22:24:34,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:34,645 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:34,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:34,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash -693365967, now seen corresponding path program 1 times [2025-03-03 22:24:34,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:24:34,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523557973] [2025-03-03 22:24:34,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:34,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:24:34,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 22:24:34,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 22:24:34,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:34,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:24:34,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:24:34,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523557973] [2025-03-03 22:24:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523557973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:24:34,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364278553] [2025-03-03 22:24:34,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:34,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:24:34,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:24:34,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:24:34,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:24:34,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 22:24:34,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 22:24:34,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:34,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:34,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:24:35,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:24:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:24:35,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:24:35,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364278553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:24:35,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:24:35,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:24:35,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586960635] [2025-03-03 22:24:35,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:24:35,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:24:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:24:35,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:24:35,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:24:35,068 INFO L87 Difference]: Start difference. First operand has 76 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:24:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:24:35,095 INFO L93 Difference]: Finished difference Result 146 states and 241 transitions. [2025-03-03 22:24:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:24:35,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2025-03-03 22:24:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:24:35,103 INFO L225 Difference]: With dead ends: 146 [2025-03-03 22:24:35,104 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 22:24:35,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:24:35,110 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:24:35,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:24:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 22:24:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-03 22:24:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:24:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2025-03-03 22:24:35,147 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 133 [2025-03-03 22:24:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:24:35,148 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2025-03-03 22:24:35,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:24:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2025-03-03 22:24:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 22:24:35,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:35,153 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:35,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:24:35,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:24:35,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:35,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1151363795, now seen corresponding path program 1 times [2025-03-03 22:24:35,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:24:35,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130716340] [2025-03-03 22:24:35,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:24:35,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 22:24:35,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 22:24:35,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:35,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:24:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:24:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130716340] [2025-03-03 22:24:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130716340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:24:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94959405] [2025-03-03 22:24:35,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:35,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:24:35,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:24:35,753 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-03 22:24:35,755 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-03 22:24:35,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 22:24:35,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 22:24:35,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:35,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:35,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:24:35,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:24:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-03-03 22:24:36,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:24:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:24:36,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94959405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:24:36,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:24:36,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 22:24:36,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527701837] [2025-03-03 22:24:36,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:24:36,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:24:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:24:36,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:24:36,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:24:36,199 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-03 22:24:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:24:36,360 INFO L93 Difference]: Finished difference Result 149 states and 218 transitions. [2025-03-03 22:24:36,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:24:36,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 133 [2025-03-03 22:24:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:24:36,363 INFO L225 Difference]: With dead ends: 149 [2025-03-03 22:24:36,363 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 22:24:36,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:24:36,365 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 107 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:24:36,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 168 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:24:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 22:24:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2025-03-03 22:24:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:24:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2025-03-03 22:24:36,375 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 133 [2025-03-03 22:24:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:24:36,376 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2025-03-03 22:24:36,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-03 22:24:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2025-03-03 22:24:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 22:24:36,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:36,379 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:36,386 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-03 22:24:36,579 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,SelfDestructingSolverStorable1 [2025-03-03 22:24:36,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:36,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1906927120, now seen corresponding path program 1 times [2025-03-03 22:24:36,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:24:36,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392547580] [2025-03-03 22:24:36,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:36,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:24:36,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 22:24:36,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 22:24:36,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:36,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:24:36,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:24:36,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392547580] [2025-03-03 22:24:36,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392547580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:24:36,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031207062] [2025-03-03 22:24:36,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:36,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:24:36,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:24:36,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:24:36,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:24:36,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 22:24:36,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 22:24:36,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:36,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:36,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:24:36,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:24:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-03-03 22:24:37,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:24:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:24:37,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031207062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:24:37,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:24:37,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-03 22:24:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012950164] [2025-03-03 22:24:37,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:24:37,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:24:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:24:37,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:24:37,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:24:37,269 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2025-03-03 22:24:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:24:37,561 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2025-03-03 22:24:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:24:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) Word has length 134 [2025-03-03 22:24:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:24:37,564 INFO L225 Difference]: With dead ends: 155 [2025-03-03 22:24:37,565 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 22:24:37,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-03-03 22:24:37,567 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 107 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:24:37,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 468 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:24:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 22:24:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-03-03 22:24:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:24:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 111 transitions. [2025-03-03 22:24:37,582 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 111 transitions. Word has length 134 [2025-03-03 22:24:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:24:37,582 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 111 transitions. [2025-03-03 22:24:37,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2025-03-03 22:24:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 111 transitions. [2025-03-03 22:24:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 22:24:37,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:37,584 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:37,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 22:24:37,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:24:37,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:37,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:37,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1777844401, now seen corresponding path program 1 times [2025-03-03 22:24:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:24:37,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220875784] [2025-03-03 22:24:37,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:37,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:24:37,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 22:24:37,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 22:24:37,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:37,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:24:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:24:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220875784] [2025-03-03 22:24:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220875784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:24:38,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:24:38,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:24:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768005859] [2025-03-03 22:24:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:24:38,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:24:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:24:38,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:24:38,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:24:38,037 INFO L87 Difference]: Start difference. First operand 79 states and 111 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:24:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:24:38,236 INFO L93 Difference]: Finished difference Result 163 states and 226 transitions. [2025-03-03 22:24:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:24:38,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2025-03-03 22:24:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:24:38,237 INFO L225 Difference]: With dead ends: 163 [2025-03-03 22:24:38,237 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 22:24:38,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:24:38,238 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 126 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:24:38,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 181 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:24:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 22:24:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-03-03 22:24:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:24:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2025-03-03 22:24:38,248 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 134 [2025-03-03 22:24:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:24:38,248 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2025-03-03 22:24:38,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:24:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2025-03-03 22:24:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 22:24:38,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:38,250 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:38,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:24:38,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:38,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:38,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1974357906, now seen corresponding path program 1 times [2025-03-03 22:24:38,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:24:38,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911967096] [2025-03-03 22:24:38,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:38,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:24:38,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 22:24:38,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 22:24:38,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:38,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:24:38,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175763890] [2025-03-03 22:24:38,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:38,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:24:38,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:24:38,298 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:24:38,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 22:24:38,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 22:24:38,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 22:24:38,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:38,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:24:38,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:24:38,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 22:24:38,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 22:24:38,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:38,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:24:38,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:24:38,469 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:24:38,470 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:24:38,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 22:24:38,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:24:38,676 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 22:24:38,750 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:24:38,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:24:38 BoogieIcfgContainer [2025-03-03 22:24:38,753 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:24:38,753 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:24:38,753 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:24:38,754 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:24:38,754 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:24:34" (3/4) ... [2025-03-03 22:24:38,756 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:24:38,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:24:38,757 INFO L158 Benchmark]: Toolchain (without parser) took 4801.98ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 105.4MB in the beginning and 255.5MB in the end (delta: -150.2MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-03-03 22:24:38,757 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:24:38,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.18ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.1MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:24:38,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.07ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:24:38,757 INFO L158 Benchmark]: Boogie Preprocessor took 44.36ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:24:38,757 INFO L158 Benchmark]: IcfgBuilder took 339.28ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 65.9MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 22:24:38,758 INFO L158 Benchmark]: TraceAbstraction took 4195.12ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 64.9MB in the beginning and 256.9MB in the end (delta: -192.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:24:38,758 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 310.4MB. Free memory is still 255.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:24:38,759 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.17ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.18ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.1MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.07ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.36ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 339.28ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 65.9MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4195.12ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 64.9MB in the beginning and 256.9MB in the end (delta: -192.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 310.4MB. Free memory is still 255.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] float var_1_2 = 4.5; [L24] float var_1_3 = 64.8; [L25] float var_1_4 = 64.4; [L26] float var_1_5 = 0.2; [L27] signed short int var_1_7 = 10000; [L28] signed short int var_1_8 = 1; [L29] signed short int var_1_9 = 50; [L30] signed short int var_1_10 = 8; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 100; [L33] unsigned short int var_1_15 = 128; [L34] unsigned short int var_1_16 = 23647; [L35] unsigned short int var_1_17 = 32; [L36] signed char var_1_18 = 0; [L37] signed char var_1_19 = -50; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; VAL [isInitial=0, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=9/2, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] FCALL updateLastVariables() [L116] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L73] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] var_1_3 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L75] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L76] var_1_4 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L78] var_1_5 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L79] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] var_1_7 = __VERIFIER_nondet_short() [L81] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L81] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L82] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L82] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L83] var_1_8 = __VERIFIER_nondet_short() [L84] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L84] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L85] CALL assume_abort_if_not(var_1_8 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L85] RET assume_abort_if_not(var_1_8 <= 8192) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L86] var_1_9 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_9 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_9 <= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L89] var_1_10 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L92] var_1_14 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L95] var_1_16 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L98] var_1_19 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L100] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L101] var_1_21 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L102] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L103] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L116] RET updateVariables() [L117] CALL step() [L43] var_1_18 = var_1_19 [L44] var_1_20 = var_1_21 [L45] signed char stepLocal_1 = var_1_18; [L46] signed long int stepLocal_0 = var_1_9 / var_1_7; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L47] EXPR var_1_8 << var_1_10 VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L47] COND FALSE !(stepLocal_1 > (var_1_8 << var_1_10)) [L54] EXPR var_1_7 ^ var_1_18 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L54] signed long int stepLocal_2 = var_1_7 ^ var_1_18; [L55] COND FALSE !(var_1_14 >= stepLocal_2) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L58] COND TRUE var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5)))) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L59] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L69] var_1_17 = var_1_1 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L108] EXPR (((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L108-L109] return ((((((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1)) && (var_1_17 == ((unsigned short int) var_1_1))) && (var_1_18 == ((signed char) var_1_19))) && (var_1_20 == ((unsigned char) var_1_21)) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 340 mSDsluCounter, 921 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 605 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 686 IncrementalHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 316 mSDtfsCounter, 686 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 700 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=4, InterpolantAutomatonStates: 30, 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1202 NumberOfCodeBlocks, 1202 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1958 SizeOfPredicates, 2 NumberOfNonLiveVariables, 913 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 6532/6840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:24:38,774 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_has-floats_file-43.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 13083d95d661542b4d69cfedb32ccc83a061059041df5cc86775c87ade99f3f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:24:40,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:24:40,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:24:40,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:24:40,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:24:40,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:24:40,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:24:40,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:24:40,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:24:40,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:24:40,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:24:40,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:24:40,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:24:40,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:24:40,727 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:24:40,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:24:40,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:24:40,727 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:24:40,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:24:40,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:24:40,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:24:40,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:24:40,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:24:40,728 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:24:40,728 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:24:40,728 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:24:40,728 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:24:40,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:24:40,728 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:24:40,728 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:24:40,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:24:40,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:24:40,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:24:40,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:24:40,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:24:40,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:24:40,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:24:40,729 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:24:40,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:24:40,729 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:24:40,730 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:24:40,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:24:40,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:24:40,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:24:40,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:24:40,730 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 -> 13083d95d661542b4d69cfedb32ccc83a061059041df5cc86775c87ade99f3f0 [2025-03-03 22:24:40,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:24:40,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:24:40,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:24:40,978 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:24:40,978 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:24:40,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-43.i [2025-03-03 22:24:42,210 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e77876b8/a2ed94b8e0e74801a243e2242590a695/FLAGa9dd2ab32 [2025-03-03 22:24:42,388 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:24:42,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-43.i [2025-03-03 22:24:42,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e77876b8/a2ed94b8e0e74801a243e2242590a695/FLAGa9dd2ab32 [2025-03-03 22:24:42,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e77876b8/a2ed94b8e0e74801a243e2242590a695 [2025-03-03 22:24:42,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:24:42,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:24:42,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:24:42,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:24:42,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:24:42,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423e1a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42, skipping insertion in model container [2025-03-03 22:24:42,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:24:42,547 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_has-floats_file-43.i[917,930] [2025-03-03 22:24:42,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:24:42,597 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:24:42,608 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_has-floats_file-43.i[917,930] [2025-03-03 22:24:42,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:24:42,647 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:24:42,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42 WrapperNode [2025-03-03 22:24:42,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:24:42,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:24:42,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:24:42,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:24:42,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,686 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-03 22:24:42,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:24:42,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:24:42,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:24:42,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:24:42,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,716 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:24:42,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:24:42,739 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:24:42,743 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:24:42,744 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:24:42,745 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (1/1) ... [2025-03-03 22:24:42,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:24:42,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:24:42,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:24:42,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:24:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:24:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:24:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:24:42,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:24:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:24:42,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:24:42,867 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:24:42,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:24:43,245 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 22:24:43,245 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:24:43,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:24:43,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:24:43,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:24:43 BoogieIcfgContainer [2025-03-03 22:24:43,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:24:43,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:24:43,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:24:43,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:24:43,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:24:42" (1/3) ... [2025-03-03 22:24:43,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115f82bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:24:43, skipping insertion in model container [2025-03-03 22:24:43,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:42" (2/3) ... [2025-03-03 22:24:43,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115f82bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:24:43, skipping insertion in model container [2025-03-03 22:24:43,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:24:43" (3/3) ... [2025-03-03 22:24:43,264 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-43.i [2025-03-03 22:24:43,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:24:43,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-43.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:24:43,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:24:43,324 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;@3e850c8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:24:43,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:24:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:24:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 22:24:43,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:43,335 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:43,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash 155377873, now seen corresponding path program 1 times [2025-03-03 22:24:43,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:24:43,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314230936] [2025-03-03 22:24:43,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:24:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:24:43,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:24:43,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:24:43,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 22:24:43,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 22:24:43,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:43,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:43,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:24:43,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:24:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:24:43,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:24:43,671 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:24:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314230936] [2025-03-03 22:24:43,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314230936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:24:43,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:24:43,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:24:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120123218] [2025-03-03 22:24:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:24:43,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:24:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:24:43,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:24:43,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:24:43,690 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:24:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:24:43,705 INFO L93 Difference]: Finished difference Result 110 states and 185 transitions. [2025-03-03 22:24:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:24:43,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2025-03-03 22:24:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:24:43,711 INFO L225 Difference]: With dead ends: 110 [2025-03-03 22:24:43,711 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 22:24:43,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:24:43,715 INFO L435 NwaCegarLoop]: 80 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, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:24:43,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:24:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 22:24:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 22:24:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:24:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2025-03-03 22:24:43,741 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 127 [2025-03-03 22:24:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:24:43,742 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2025-03-03 22:24:43,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:24:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2025-03-03 22:24:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 22:24:43,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:43,746 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:43,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:24:43,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:24:43,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:43,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:43,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1397657549, now seen corresponding path program 1 times [2025-03-03 22:24:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:24:43,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931425130] [2025-03-03 22:24:43,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:43,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:24:43,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:24:43,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:24:43,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:24:44,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 22:24:44,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 22:24:44,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:44,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:44,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:24:44,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:24:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:24:44,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:24:44,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:24:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931425130] [2025-03-03 22:24:44,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931425130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:24:44,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:24:44,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:24:44,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062822836] [2025-03-03 22:24:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:24:44,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:24:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:24:44,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:24:44,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:24:44,264 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:24:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:24:44,669 INFO L93 Difference]: Finished difference Result 115 states and 164 transitions. [2025-03-03 22:24:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:24:44,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2025-03-03 22:24:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:24:44,675 INFO L225 Difference]: With dead ends: 115 [2025-03-03 22:24:44,675 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 22:24:44,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:24:44,676 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 77 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:24:44,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 117 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:24:44,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 22:24:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-03-03 22:24:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:24:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2025-03-03 22:24:44,690 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 127 [2025-03-03 22:24:44,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:24:44,690 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2025-03-03 22:24:44,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:24:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2025-03-03 22:24:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 22:24:44,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:44,693 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:44,702 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-03 22:24:44,893 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-03 22:24:44,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:44,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1426286700, now seen corresponding path program 1 times [2025-03-03 22:24:44,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:24:44,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814850829] [2025-03-03 22:24:44,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:44,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:24:44,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:24:44,898 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-03 22:24:44,900 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-03 22:24:44,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 22:24:45,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 22:24:45,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:45,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:45,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 22:24:45,122 INFO L279 TraceCheckSpWp]: Computing forward predicates...