./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-93.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 d74c0455c87cef102604b37fc1f44a968952b0e3b536842e46dc96fafbaca8c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:08:00,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:08:00,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:08:00,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:08:00,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:08:00,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:08:00,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:08:00,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:08:00,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:08:00,325 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:08:00,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:08:00,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:08:00,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:08:00,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:08:00,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:08:00,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:08:00,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:08:00,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:08:00,327 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 -> d74c0455c87cef102604b37fc1f44a968952b0e3b536842e46dc96fafbaca8c9 [2025-03-08 10:08:00,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:08:00,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:08:00,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:08:00,607 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:08:00,607 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:08:00,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-93.i [2025-03-08 10:08:01,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef491d95b/8cd3e52e4e2b4efba6c79ef37015cd73/FLAG999e3a21c [2025-03-08 10:08:02,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:08:02,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-93.i [2025-03-08 10:08:02,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef491d95b/8cd3e52e4e2b4efba6c79ef37015cd73/FLAG999e3a21c [2025-03-08 10:08:02,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef491d95b/8cd3e52e4e2b4efba6c79ef37015cd73 [2025-03-08 10:08:02,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:08:02,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:08:02,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:08:02,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:08:02,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:08:02,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4414e23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02, skipping insertion in model container [2025-03-08 10:08:02,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:08:02,201 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_codestructure_normal_file-93.i[913,926] [2025-03-08 10:08:02,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:08:02,273 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:08:02,280 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_codestructure_normal_file-93.i[913,926] [2025-03-08 10:08:02,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:08:02,327 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:08:02,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02 WrapperNode [2025-03-08 10:08:02,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:08:02,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:08:02,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:08:02,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:08:02,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,369 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-03-08 10:08:02,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:08:02,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:08:02,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:08:02,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:08:02,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,389 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:08:02,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:08:02,399 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:08:02,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:08:02,399 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:08:02,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (1/1) ... [2025-03-08 10:08:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:08:02,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:08:02,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:08:02,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:08:02,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:08:02,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:08:02,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:08:02,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:08:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:08:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:08:02,521 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:08:02,523 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:08:02,761 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 10:08:02,761 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:08:02,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:08:02,770 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:08:02,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:02 BoogieIcfgContainer [2025-03-08 10:08:02,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:08:02,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:08:02,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:08:02,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:08:02,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:08:02" (1/3) ... [2025-03-08 10:08:02,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9c97c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:08:02, skipping insertion in model container [2025-03-08 10:08:02,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:02" (2/3) ... [2025-03-08 10:08:02,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9c97c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:08:02, skipping insertion in model container [2025-03-08 10:08:02,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:02" (3/3) ... [2025-03-08 10:08:02,778 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-93.i [2025-03-08 10:08:02,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:08:02,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-93.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:08:02,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:08:02,841 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;@1c72f6ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:08:02,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:08:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:08:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 10:08:02,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:02,858 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:08:02,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:02,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:02,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1152175677, now seen corresponding path program 1 times [2025-03-08 10:08:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:08:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018011070] [2025-03-08 10:08:02,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:08:02,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 10:08:02,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 10:08:02,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:02,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 10:08:03,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:08:03,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018011070] [2025-03-08 10:08:03,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018011070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:08:03,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135266459] [2025-03-08 10:08:03,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:03,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:08:03,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:08:03,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:08:03,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:08:03,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 10:08:03,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 10:08:03,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:03,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:03,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:08:03,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:08:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 10:08:03,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:08:03,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135266459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:08:03,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:08:03,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:08:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373874369] [2025-03-08 10:08:03,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:08:03,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:08:03,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:08:03,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:08:03,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:08:03,400 INFO L87 Difference]: Start difference. First operand has 79 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 10:08:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:08:03,429 INFO L93 Difference]: Finished difference Result 152 states and 273 transitions. [2025-03-08 10:08:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:08:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 194 [2025-03-08 10:08:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:08:03,436 INFO L225 Difference]: With dead ends: 152 [2025-03-08 10:08:03,436 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 10:08:03,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:08:03,444 INFO L435 NwaCegarLoop]: 118 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, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:08:03,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:08:03,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 10:08:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-08 10:08:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:08:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 118 transitions. [2025-03-08 10:08:03,488 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 118 transitions. Word has length 194 [2025-03-08 10:08:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:08:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 118 transitions. [2025-03-08 10:08:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 10:08:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 118 transitions. [2025-03-08 10:08:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 10:08:03,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:03,494 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:08:03,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:08:03,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:08:03,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:03,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1929644609, now seen corresponding path program 1 times [2025-03-08 10:08:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:08:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-03-08 10:08:03,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:03,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:08:03,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 10:08:03,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 10:08:03,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:03,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 10:08:03,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:08:03,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-03-08 10:08:03,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608268098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:08:03,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:08:03,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:08:03,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118546909] [2025-03-08 10:08:03,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:08:03,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:08:03,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:08:03,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:08:03,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:08:03,904 INFO L87 Difference]: Start difference. First operand 76 states and 118 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 10:08:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:08:03,959 INFO L93 Difference]: Finished difference Result 183 states and 281 transitions. [2025-03-08 10:08:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:08:03,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-08 10:08:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:08:03,964 INFO L225 Difference]: With dead ends: 183 [2025-03-08 10:08:03,964 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 10:08:03,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:08:03,967 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 47 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:08:03,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 247 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:08:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 10:08:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2025-03-08 10:08:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 63 states have internal predecessors, (78), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 10:08:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2025-03-08 10:08:03,991 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 194 [2025-03-08 10:08:03,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:08:03,991 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2025-03-08 10:08:03,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 10:08:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2025-03-08 10:08:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 10:08:03,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:03,994 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:08:03,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:08:03,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:03,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 201841796, now seen corresponding path program 1 times [2025-03-08 10:08:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:08:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700430948] [2025-03-08 10:08:03,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:08:04,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 10:08:04,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 10:08:04,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:04,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:08:04,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:08:04,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 10:08:04,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 10:08:04,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:04,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:08:04,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:08:04,277 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:08:04,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:08:04,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:08:04,281 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 10:08:04,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:08:04,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:08:04 BoogieIcfgContainer [2025-03-08 10:08:04,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:08:04,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:08:04,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:08:04,383 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:08:04,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:02" (3/4) ... [2025-03-08 10:08:04,385 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:08:04,386 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:08:04,387 INFO L158 Benchmark]: Toolchain (without parser) took 2322.56ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 75.3MB in the end (delta: 38.0MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2025-03-08 10:08:04,387 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:08:04,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.15ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:08:04,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.00ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:08:04,388 INFO L158 Benchmark]: Boogie Preprocessor took 27.99ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 94.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:08:04,389 INFO L158 Benchmark]: IcfgBuilder took 371.72ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 73.9MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:08:04,389 INFO L158 Benchmark]: TraceAbstraction took 1609.85ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 75.4MB in the end (delta: -1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:08:04,389 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 75.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:08:04,391 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.15ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.00ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.99ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 94.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 371.72ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 73.9MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1609.85ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 75.4MB in the end (delta: -1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 75.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someUnaryDOUBLEoperation at line 34, overapproximation of someBinaryArithmeticFLOAToperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.5; [L23] unsigned short int var_1_2 = 0; [L24] unsigned short int var_1_3 = 64; [L25] signed long int var_1_4 = 2; [L26] float var_1_5 = 0.0; [L27] float var_1_6 = 4.2; [L28] float var_1_7 = 31.25; [L29] float var_1_8 = 1.375; [L30] unsigned short int var_1_9 = 32; [L31] unsigned char var_1_10 = 1; [L32] float var_1_11 = 0.625; [L33] unsigned short int var_1_12 = 1; [L34] float var_1_13 = -0.25; [L35] signed short int var_1_14 = 4; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 0; [L38] signed short int var_1_17 = 8; [L39] signed short int var_1_18 = 5; [L40] signed short int var_1_19 = 128; [L41] signed long int var_1_20 = -50; [L42] signed short int var_1_21 = -16; [L43] signed short int var_1_22 = 16; [L44] signed short int var_1_23 = 32; [L45] signed short int var_1_24 = 2; [L46] signed short int var_1_25 = -4; VAL [isInitial=0, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_2=0, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L151] isInitial = 1 [L152] FCALL initially() [L153] COND TRUE 1 [L154] FCALL updateLastVariables() [L155] CALL updateVariables() [L93] var_1_2 = __VERIFIER_nondet_ushort() [L94] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L94] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L95] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L95] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L96] var_1_3 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L97] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L98] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L98] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L99] var_1_4 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L100] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L101] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L101] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L102] var_1_5 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L103] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L104] var_1_6 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L105] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L106] var_1_7 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_8=11/8, var_1_9=32] [L107] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_8=11/8, var_1_9=32] [L108] var_1_8 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L109] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L110] var_1_10 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L111] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L112] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L112] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L113] var_1_11 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L114] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L115] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L115] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L116] var_1_12 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L117] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L118] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L118] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L119] var_1_15 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L120] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L121] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L121] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L122] var_1_16 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L123] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L124] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L124] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L125] var_1_17 = __VERIFIER_nondet_short() [L126] CALL assume_abort_if_not(var_1_17 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L126] RET assume_abort_if_not(var_1_17 >= -32767) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L127] CALL assume_abort_if_not(var_1_17 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L127] RET assume_abort_if_not(var_1_17 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L128] var_1_18 = __VERIFIER_nondet_short() [L129] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L129] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L130] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L130] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L131] var_1_19 = __VERIFIER_nondet_short() [L132] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L132] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L133] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L133] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L134] var_1_22 = __VERIFIER_nondet_short() [L135] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L135] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L136] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L136] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=50, var_1_9=32] [L137] var_1_24 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_24 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=50, var_1_9=32] [L138] RET assume_abort_if_not(var_1_24 >= -8192) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=50, var_1_9=32] [L139] CALL assume_abort_if_not(var_1_24 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=50, var_1_9=32] [L139] RET assume_abort_if_not(var_1_24 <= 8192) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=50, var_1_9=32] [L140] var_1_25 = __VERIFIER_nondet_short() [L141] CALL assume_abort_if_not(var_1_25 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=50, var_1_9=32] [L141] RET assume_abort_if_not(var_1_25 >= -8191) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=50, var_1_9=32] [L142] CALL assume_abort_if_not(var_1_25 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=50, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=50, var_1_9=32] [L142] RET assume_abort_if_not(var_1_25 <= 8191) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=50, var_1_9=32] [L155] RET updateVariables() [L156] CALL step() [L50] COND FALSE !((var_1_2 + var_1_3) < var_1_4) [L59] var_1_1 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=32] [L61] COND FALSE !(var_1_10 || (var_1_1 < (var_1_8 / var_1_11))) [L66] var_1_9 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=-2] [L68] COND FALSE !(\read(var_1_10)) [L71] var_1_13 = ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=-2] [L73] COND TRUE (! (var_1_10 || var_1_15)) || var_1_16 [L74] var_1_14 = ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=32766, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=-2] [L76] COND TRUE \read(var_1_16) [L77] var_1_20 = (var_1_3 - 50) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=32766, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=0, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=-2] [L79] COND TRUE \read(var_1_15) [L80] var_1_21 = ((var_1_22 + 25) - var_1_19) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=32766, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=0, var_1_21=-32741, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=-2] [L82] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=32766, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=0, var_1_21=-32741, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=-2] [L85] COND TRUE \read(var_1_16) [L86] var_1_23 = var_1_24 VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=32766, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=0, var_1_21=-32741, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=-2] [L156] RET step() [L157] CALL, EXPR property() [L147-L148] return ((((((((var_1_2 + var_1_3) < var_1_4) ? ((var_1_4 <= (var_1_3 - var_1_2)) ? ((var_1_4 < var_1_3) ? (var_1_1 == ((float) ((var_1_5 - var_1_6) - var_1_7))) : 1) : (var_1_1 == ((float) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) + 3.25f)))) : (var_1_1 == ((float) var_1_8))) && ((var_1_10 || (var_1_1 < (var_1_8 / var_1_11))) ? ((var_1_10 || (var_1_1 != var_1_11)) ? (var_1_9 == ((unsigned short int) 8)) : 1) : (var_1_9 == ((unsigned short int) var_1_12)))) && (var_1_10 ? (var_1_13 == ((float) ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))))) : (var_1_13 == ((float) ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))))))) && (((! (var_1_10 || var_1_15)) || var_1_16) ? (var_1_14 == ((signed short int) ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))))) : 1)) && (var_1_16 ? (var_1_20 == ((signed long int) (var_1_3 - 50))) : 1)) && (var_1_15 ? (var_1_21 == ((signed short int) ((var_1_22 + 25) - var_1_19))) : 1)) && (var_1_10 ? (var_1_23 == ((signed short int) (var_1_22 + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_25)))) : (var_1_16 ? (var_1_23 == ((signed short int) var_1_24)) : (var_1_23 == ((signed short int) var_1_17)))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=32766, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=0, var_1_21=-32741, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=-2] [L157] RET, EXPR property() [L157] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=32766, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=0, var_1_21=-32741, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=-2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=32766, var_1_15=1, var_1_16=1, var_1_17=32766, var_1_18=-1, var_1_19=32766, var_1_1=32771, var_1_20=0, var_1_21=-32741, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=50, var_1_4=50, var_1_8=32771, var_1_9=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 155 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 365 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 263 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 777 NumberOfCodeBlocks, 777 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 5890/5952 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:08:04,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-93.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 d74c0455c87cef102604b37fc1f44a968952b0e3b536842e46dc96fafbaca8c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:08:06,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:08:06,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:08:06,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:08:06,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:08:06,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:08:06,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:08:06,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:08:06,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:08:06,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:08:06,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:08:06,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:08:06,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:08:06,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:08:06,413 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:08:06,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:08:06,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:08:06,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:08:06,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:08:06,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:08:06,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:08:06,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:08:06,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:08:06,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:08:06,414 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:08:06,414 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:08:06,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:08:06,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:08:06,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:08:06,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:08:06,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:08:06,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:08:06,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:08:06,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:08:06,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:08:06,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:08:06,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:08:06,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:08:06,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:08:06,416 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:08:06,416 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:08:06,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:08:06,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:08:06,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:08:06,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:08:06,417 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 -> d74c0455c87cef102604b37fc1f44a968952b0e3b536842e46dc96fafbaca8c9 [2025-03-08 10:08:06,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:08:06,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:08:06,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:08:06,686 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:08:06,687 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:08:06,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-93.i [2025-03-08 10:08:07,860 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16f7e630/731326cca4d64ab0b5eac35547110e31/FLAG1d572575d [2025-03-08 10:08:08,115 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:08:08,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-93.i [2025-03-08 10:08:08,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16f7e630/731326cca4d64ab0b5eac35547110e31/FLAG1d572575d [2025-03-08 10:08:08,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16f7e630/731326cca4d64ab0b5eac35547110e31 [2025-03-08 10:08:08,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:08:08,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:08:08,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:08:08,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:08:08,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:08:08,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ed5a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08, skipping insertion in model container [2025-03-08 10:08:08,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:08:08,261 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_codestructure_normal_file-93.i[913,926] [2025-03-08 10:08:08,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:08:08,311 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:08:08,319 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_codestructure_normal_file-93.i[913,926] [2025-03-08 10:08:08,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:08:08,359 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:08:08,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08 WrapperNode [2025-03-08 10:08:08,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:08:08,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:08:08,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:08:08,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:08:08,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,393 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2025-03-08 10:08:08,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:08:08,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:08:08,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:08:08,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:08:08,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,413 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:08:08,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:08:08,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:08:08,434 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:08:08,434 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:08:08,435 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (1/1) ... [2025-03-08 10:08:08,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:08:08,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:08:08,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:08:08,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:08:08,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:08:08,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:08:08,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:08:08,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:08:08,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:08:08,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:08:08,556 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:08:08,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:08:14,275 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 10:08:14,275 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:08:14,303 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:08:14,303 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:08:14,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:14 BoogieIcfgContainer [2025-03-08 10:08:14,304 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:08:14,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:08:14,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:08:14,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:08:14,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:08:08" (1/3) ... [2025-03-08 10:08:14,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24187488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:08:14, skipping insertion in model container [2025-03-08 10:08:14,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:08" (2/3) ... [2025-03-08 10:08:14,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24187488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:08:14, skipping insertion in model container [2025-03-08 10:08:14,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:14" (3/3) ... [2025-03-08 10:08:14,311 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-93.i [2025-03-08 10:08:14,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:08:14,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-93.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:08:14,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:08:14,370 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;@630550c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:08:14,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:08:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:08:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 10:08:14,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:14,383 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:08:14,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:14,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1152175677, now seen corresponding path program 1 times [2025-03-08 10:08:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:08:14,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494423697] [2025-03-08 10:08:14,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:14,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:08:14,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:08:14,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:08:14,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:08:14,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 10:08:14,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 10:08:14,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:14,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:14,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:08:14,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:08:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 10:08:14,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:08:14,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:08:14,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494423697] [2025-03-08 10:08:14,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494423697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:08:14,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:08:14,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:08:14,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733437829] [2025-03-08 10:08:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:08:14,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:08:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:08:14,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:08:14,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:08:14,831 INFO L87 Difference]: Start difference. First operand has 79 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 10:08:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:08:14,857 INFO L93 Difference]: Finished difference Result 152 states and 273 transitions. [2025-03-08 10:08:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:08:14,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 194 [2025-03-08 10:08:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:08:14,865 INFO L225 Difference]: With dead ends: 152 [2025-03-08 10:08:14,865 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 10:08:14,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:08:14,869 INFO L435 NwaCegarLoop]: 118 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, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:08:14,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:08:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 10:08:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-08 10:08:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:08:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 118 transitions. [2025-03-08 10:08:14,910 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 118 transitions. Word has length 194 [2025-03-08 10:08:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:08:14,911 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 118 transitions. [2025-03-08 10:08:14,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 10:08:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 118 transitions. [2025-03-08 10:08:14,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 10:08:14,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:14,916 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:08:14,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 10:08:15,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:08:15,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:15,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1929644609, now seen corresponding path program 1 times [2025-03-08 10:08:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:08:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605735018] [2025-03-08 10:08:15,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:15,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:08:15,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:08:15,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:08:15,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:08:15,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 10:08:15,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 10:08:15,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:15,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:15,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 10:08:15,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:08:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 10:08:15,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:08:15,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:08:15,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605735018] [2025-03-08 10:08:15,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605735018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:08:15,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:08:15,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:08:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533306007] [2025-03-08 10:08:15,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:08:15,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:08:15,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:08:15,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:08:15,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:08:15,537 INFO L87 Difference]: Start difference. First operand 76 states and 118 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 10:08:20,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:08:22,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:08:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:08:22,285 INFO L93 Difference]: Finished difference Result 183 states and 281 transitions. [2025-03-08 10:08:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:08:22,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2025-03-08 10:08:22,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:08:22,290 INFO L225 Difference]: With dead ends: 183 [2025-03-08 10:08:22,290 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 10:08:22,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:08:22,291 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 47 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:08:22,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 247 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2025-03-08 10:08:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 10:08:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2025-03-08 10:08:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 63 states have internal predecessors, (78), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 10:08:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2025-03-08 10:08:22,310 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 194 [2025-03-08 10:08:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:08:22,310 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2025-03-08 10:08:22,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 10:08:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2025-03-08 10:08:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 10:08:22,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:22,312 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:08:22,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 10:08:22,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:08:22,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:22,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash 201841796, now seen corresponding path program 1 times [2025-03-08 10:08:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:08:22,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248910768] [2025-03-08 10:08:22,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:22,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:08:22,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:08:22,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:08:22,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 10:08:22,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 10:08:22,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 10:08:22,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:22,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:22,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 10:08:22,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:08:56,399 WARN L286 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)