./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.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 f17c0065d06bd69e701e1c7b4b8519084c98c9a0a14ee3995ac94291f3ffbf91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:41:06,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:41:06,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:41:06,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:41:06,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:41:06,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:41:06,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:41:06,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:41:06,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:41:06,269 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:41:06,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:41:06,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:41:06,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:41:06,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:41:06,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:41:06,272 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:41:06,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:41:06,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:41:06,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:41:06,273 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:41:06,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:41:06,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:41:06,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:41:06,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:41:06,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:41:06,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:41:06,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:41:06,273 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 -> f17c0065d06bd69e701e1c7b4b8519084c98c9a0a14ee3995ac94291f3ffbf91 [2025-03-03 18:41:06,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:41:06,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:41:06,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:41:06,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:41:06,510 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:41:06,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i [2025-03-03 18:41:07,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e70ca268c/8cca4608776d44d78425d1037f51a596/FLAG32d771382 [2025-03-03 18:41:08,006 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:41:08,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i [2025-03-03 18:41:08,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e70ca268c/8cca4608776d44d78425d1037f51a596/FLAG32d771382 [2025-03-03 18:41:08,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e70ca268c/8cca4608776d44d78425d1037f51a596 [2025-03-03 18:41:08,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:41:08,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:41:08,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:41:08,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:41:08,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:41:08,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08, skipping insertion in model container [2025-03-03 18:41:08,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:41:08,415 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_dependencies_file-71.i[919,932] [2025-03-03 18:41:08,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:41:08,488 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:41:08,497 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_dependencies_file-71.i[919,932] [2025-03-03 18:41:08,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:41:08,546 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:41:08,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08 WrapperNode [2025-03-03 18:41:08,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:41:08,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:41:08,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:41:08,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:41:08,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,592 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-03 18:41:08,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:41:08,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:41:08,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:41:08,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:41:08,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,630 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:41:08,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:41:08,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:41:08,653 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:41:08,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:41:08,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (1/1) ... [2025-03-03 18:41:08,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:41:08,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:41:08,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:41:08,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:41:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:41:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:41:08,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:41:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:41:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:41:08,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:41:08,768 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:41:08,770 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:41:09,023 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:41:09,023 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:41:09,030 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:41:09,030 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:41:09,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:41:09 BoogieIcfgContainer [2025-03-03 18:41:09,031 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:41:09,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:41:09,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:41:09,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:41:09,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:41:08" (1/3) ... [2025-03-03 18:41:09,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74879790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:41:09, skipping insertion in model container [2025-03-03 18:41:09,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:08" (2/3) ... [2025-03-03 18:41:09,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74879790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:41:09, skipping insertion in model container [2025-03-03 18:41:09,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:41:09" (3/3) ... [2025-03-03 18:41:09,037 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-71.i [2025-03-03 18:41:09,048 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:41:09,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-71.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:41:09,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:41:09,113 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;@12e383b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:41:09,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:41:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 18:41:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 18:41:09,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:09,128 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:09,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:09,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:09,135 INFO L85 PathProgramCache]: Analyzing trace with hash -483663645, now seen corresponding path program 1 times [2025-03-03 18:41:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:09,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836871749] [2025-03-03 18:41:09,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:09,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:09,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:41:09,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:41:09,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:09,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-03 18:41:09,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:41:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836871749] [2025-03-03 18:41:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836871749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:41:09,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654916518] [2025-03-03 18:41:09,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:09,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:41:09,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:41:09,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:41:09,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:41:09,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:41:09,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:41:09,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:09,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:09,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:41:09,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:41:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-03 18:41:09,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:41:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654916518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:41:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:41:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:41:09,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918992352] [2025-03-03 18:41:09,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:41:09,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:41:09,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:41:09,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:41:09,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:41:09,589 INFO L87 Difference]: Start difference. First operand has 60 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 18:41:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:09,605 INFO L93 Difference]: Finished difference Result 114 states and 196 transitions. [2025-03-03 18:41:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:41:09,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2025-03-03 18:41:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:09,611 INFO L225 Difference]: With dead ends: 114 [2025-03-03 18:41:09,611 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 18:41:09,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:41:09,616 INFO L435 NwaCegarLoop]: 85 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, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:09,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:41:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 18:41:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 18:41:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 18:41:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2025-03-03 18:41:09,654 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 132 [2025-03-03 18:41:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:09,654 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2025-03-03 18:41:09,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 18:41:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2025-03-03 18:41:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 18:41:09,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:09,657 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:09,664 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-03 18:41:09,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 18:41:09,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash -413203070, now seen corresponding path program 1 times [2025-03-03 18:41:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:09,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147993713] [2025-03-03 18:41:09,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:09,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:41:10,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:41:10,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:10,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:41:10,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403857870] [2025-03-03 18:41:10,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:10,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:41:10,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:41:10,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:41:10,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:41:10,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:41:10,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:41:10,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:10,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:10,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 18:41:10,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:41:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 42 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-03-03 18:41:11,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:41:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:41:11,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147993713] [2025-03-03 18:41:11,295 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 18:41:11,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403857870] [2025-03-03 18:41:11,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403857870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:41:11,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:41:11,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-03 18:41:11,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960646589] [2025-03-03 18:41:11,295 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 18:41:11,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:41:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:41:11,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:41:11,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:41:11,297 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-03 18:41:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:11,626 INFO L93 Difference]: Finished difference Result 172 states and 255 transitions. [2025-03-03 18:41:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:41:11,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 132 [2025-03-03 18:41:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:11,629 INFO L225 Difference]: With dead ends: 172 [2025-03-03 18:41:11,629 INFO L226 Difference]: Without dead ends: 118 [2025-03-03 18:41:11,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:41:11,631 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:11,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 318 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:41:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-03 18:41:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2025-03-03 18:41:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 18:41:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 149 transitions. [2025-03-03 18:41:11,659 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 149 transitions. Word has length 132 [2025-03-03 18:41:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:11,661 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 149 transitions. [2025-03-03 18:41:11,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-03 18:41:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 149 transitions. [2025-03-03 18:41:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 18:41:11,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:11,664 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:11,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:41:11,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 18:41:11,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:11,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:11,865 INFO L85 PathProgramCache]: Analyzing trace with hash -609716575, now seen corresponding path program 1 times [2025-03-03 18:41:11,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:11,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958048392] [2025-03-03 18:41:11,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:11,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:11,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:41:11,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:41:11,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:11,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:41:11,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791371268] [2025-03-03 18:41:11,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:11,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:41:11,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:41:11,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:41:11,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:41:12,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:41:12,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:41:12,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:12,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:41:12,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:41:12,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:41:12,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:41:12,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:12,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:41:12,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:41:12,157 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:41:12,158 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:41:12,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:41:12,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:41:12,363 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 18:41:12,445 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:41:12,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:41:12 BoogieIcfgContainer [2025-03-03 18:41:12,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:41:12,448 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:41:12,448 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:41:12,448 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:41:12,449 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:41:09" (3/4) ... [2025-03-03 18:41:12,450 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:41:12,451 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:41:12,452 INFO L158 Benchmark]: Toolchain (without parser) took 4159.44ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 40.2MB in the end (delta: 82.2MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2025-03-03 18:41:12,452 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:12,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.40ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 108.3MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:41:12,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.97ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:12,452 INFO L158 Benchmark]: Boogie Preprocessor took 55.81ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 102.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:12,453 INFO L158 Benchmark]: IcfgBuilder took 378.60ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 82.4MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:41:12,453 INFO L158 Benchmark]: TraceAbstraction took 3415.51ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 40.2MB in the end (delta: 42.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2025-03-03 18:41:12,453 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory was 40.2MB in the beginning and 40.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:12,454 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.90ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.40ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 108.3MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.97ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.81ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 102.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 378.60ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 82.4MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3415.51ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 40.2MB in the end (delta: 42.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory was 40.2MB in the beginning and 40.2MB in the end (delta: 33.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 104, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed char var_1_4 = -1; [L26] signed char var_1_5 = 4; [L27] unsigned short int var_1_9 = 35831; [L28] float var_1_10 = 1.875; [L29] float var_1_11 = 5.8; [L30] float var_1_12 = 2.375; [L31] float var_1_13 = 999999999999.75; [L32] signed short int var_1_14 = 32; [L33] signed short int var_1_15 = 25; [L34] signed short int var_1_16 = 23809; [L35] signed short int var_1_17 = 2; [L36] float var_1_18 = 499.25; [L37] signed long int var_1_19 = -4; [L38] unsigned short int var_1_20 = 10; [L39] unsigned short int var_1_21 = 16; [L40] signed char var_1_22 = -10; [L41] signed char var_1_23 = 25; [L42] float last_1_var_1_12 = 2.375; [L43] signed short int last_1_var_1_14 = 32; [L44] unsigned short int last_1_var_1_20 = 10; [L45] unsigned short int last_1_var_1_21 = 16; VAL [isInitial=0, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] CALL updateLastVariables() [L122] last_1_var_1_12 = var_1_12 [L123] last_1_var_1_14 = var_1_14 [L124] last_1_var_1_20 = var_1_20 [L125] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L135] RET updateLastVariables() [L136] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L89] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L90] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L90] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L91] var_1_3 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L93] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L93] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L94] var_1_4 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L95] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L96] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L96] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L97] var_1_5 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L98] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L99] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L99] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L100] var_1_9 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L101] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L102] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L102] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L103] var_1_11 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L104] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L105] var_1_13 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L106] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L107] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L107] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L108] var_1_15 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L109] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L110] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L110] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L111] var_1_16 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L112] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L113] CALL assume_abort_if_not(var_1_16 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L113] RET assume_abort_if_not(var_1_16 <= 32766) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L114] var_1_17 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L115] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L116] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L116] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L117] var_1_23 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L118] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L119] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L119] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L136] RET updateVariables() [L137] CALL step() [L49] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L50] COND FALSE !((var_1_4 - var_1_5) > ((last_1_var_1_14 + last_1_var_1_20) * last_1_var_1_21)) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L60] COND FALSE !(! (var_1_5 < var_1_1)) [L67] var_1_14 = ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < ((var_1_15 - (var_1_16 - var_1_17)))) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : ((var_1_15 - (var_1_16 - var_1_17))))) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L69] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L70] COND FALSE !(last_1_var_1_12 >= ((var_1_11 / var_1_13) / 31.9f)) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L77] var_1_18 = ((((((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) > (5.5f)) ? (((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) : (5.5f))) [L78] var_1_20 = var_1_15 [L79] var_1_21 = var_1_5 [L80] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=511/2, var_1_19=-4, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L81] COND TRUE \read(var_1_3) [L82] var_1_19 = ((((var_1_17) > ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21)))))) ? (var_1_17) : ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21))))))) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=511/2, var_1_19=16383, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L137] RET step() [L138] CALL, EXPR property() [L128-L129] return ((((((((var_1_2 ? (((var_1_4 - var_1_5) > ((last_1_var_1_14 + last_1_var_1_20) * last_1_var_1_21)) ? (var_1_1 == ((unsigned short int) (var_1_9 - var_1_5))) : 1) : (var_1_3 ? (var_1_1 == ((unsigned short int) 32)) : (var_1_1 == ((unsigned short int) var_1_5)))) && (var_1_10 == ((float) var_1_11))) && ((last_1_var_1_12 >= ((var_1_11 / var_1_13) / 31.9f)) ? ((var_1_14 > var_1_4) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_11))) : 1)) && ((! (var_1_5 < var_1_1)) ? ((last_1_var_1_14 >= var_1_1) ? (var_1_14 == ((signed short int) (((((128) < (((((2) < (var_1_4)) ? (2) : (var_1_4))))) ? (128) : (((((2) < (var_1_4)) ? (2) : (var_1_4)))))) + var_1_5))) : (var_1_14 == ((signed short int) ((var_1_5 - var_1_15) + var_1_4)))) : (var_1_14 == ((signed short int) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < ((var_1_15 - (var_1_16 - var_1_17)))) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : ((var_1_15 - (var_1_16 - var_1_17))))))))) && (var_1_18 == ((float) ((((((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) > (5.5f)) ? (((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) : (5.5f)))))) && (var_1_3 ? (var_1_19 == ((signed long int) ((((var_1_17) > ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21)))))) ? (var_1_17) : ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21))))))))) : (var_1_19 == ((signed long int) var_1_5)))) && (var_1_20 == ((unsigned short int) var_1_15))) && (var_1_21 == ((unsigned short int) var_1_5))) && (var_1_22 == ((signed char) var_1_23)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=511/2, var_1_19=16383, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=511/2, var_1_19=16383, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=511/2, var_1_19=16383, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 403 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 134 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 1664 SizeOfPredicates, 7 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2438/2520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 18:41:12,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.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 f17c0065d06bd69e701e1c7b4b8519084c98c9a0a14ee3995ac94291f3ffbf91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:41:14,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:41:14,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:41:14,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:41:14,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:41:14,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:41:14,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:41:14,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:41:14,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:41:14,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:41:14,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:41:14,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:41:14,549 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:41:14,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:41:14,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:41:14,550 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:41:14,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:41:14,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:41:14,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:41:14,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:41:14,553 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 -> f17c0065d06bd69e701e1c7b4b8519084c98c9a0a14ee3995ac94291f3ffbf91 [2025-03-03 18:41:14,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:41:14,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:41:14,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:41:14,798 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:41:14,798 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:41:14,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i [2025-03-03 18:41:15,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafc70b2c/3894e331b25d4075badea54b17639035/FLAGbed75220d [2025-03-03 18:41:16,187 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:41:16,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i [2025-03-03 18:41:16,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafc70b2c/3894e331b25d4075badea54b17639035/FLAGbed75220d [2025-03-03 18:41:16,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafc70b2c/3894e331b25d4075badea54b17639035 [2025-03-03 18:41:16,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:41:16,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:41:16,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:41:16,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:41:16,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:41:16,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b62d69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16, skipping insertion in model container [2025-03-03 18:41:16,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:41:16,675 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_dependencies_file-71.i[919,932] [2025-03-03 18:41:16,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:41:16,743 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:41:16,753 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_dependencies_file-71.i[919,932] [2025-03-03 18:41:16,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:41:16,795 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:41:16,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16 WrapperNode [2025-03-03 18:41:16,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:41:16,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:41:16,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:41:16,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:41:16,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,841 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-03 18:41:16,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:41:16,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:41:16,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:41:16,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:41:16,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,871 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:41:16,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:41:16,900 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:41:16,900 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:41:16,900 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:41:16,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (1/1) ... [2025-03-03 18:41:16,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:41:16,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:41:16,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:41:16,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:41:16,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:41:16,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:41:16,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:41:16,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:41:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:41:16,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:41:17,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:41:17,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:41:28,338 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:41:28,338 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:41:28,345 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:41:28,345 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:41:28,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:41:28 BoogieIcfgContainer [2025-03-03 18:41:28,346 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:41:28,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:41:28,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:41:28,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:41:28,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:41:16" (1/3) ... [2025-03-03 18:41:28,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb20e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:41:28, skipping insertion in model container [2025-03-03 18:41:28,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:16" (2/3) ... [2025-03-03 18:41:28,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb20e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:41:28, skipping insertion in model container [2025-03-03 18:41:28,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:41:28" (3/3) ... [2025-03-03 18:41:28,356 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-71.i [2025-03-03 18:41:28,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:41:28,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-71.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:41:28,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:41:28,412 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;@21637c6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:41:28,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:41:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 18:41:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 18:41:28,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:28,427 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:28,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:28,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash -483663645, now seen corresponding path program 1 times [2025-03-03 18:41:28,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:41:28,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024436391] [2025-03-03 18:41:28,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:28,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:41:28,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:41:28,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:41:28,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 18:41:28,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:41:28,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:41:28,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:28,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:28,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:41:28,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:41:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-03 18:41:28,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:41:28,866 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:41:28,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024436391] [2025-03-03 18:41:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024436391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:41:28,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:41:28,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:41:28,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843208378] [2025-03-03 18:41:28,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:41:28,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:41:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:41:28,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:41:28,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:41:28,886 INFO L87 Difference]: Start difference. First operand has 60 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 18:41:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:28,902 INFO L93 Difference]: Finished difference Result 114 states and 196 transitions. [2025-03-03 18:41:28,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:41:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2025-03-03 18:41:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:28,907 INFO L225 Difference]: With dead ends: 114 [2025-03-03 18:41:28,908 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 18:41:28,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:41:28,925 INFO L435 NwaCegarLoop]: 85 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, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:28,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:41:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 18:41:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 18:41:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 18:41:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2025-03-03 18:41:28,951 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 132 [2025-03-03 18:41:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:28,951 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2025-03-03 18:41:28,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 18:41:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2025-03-03 18:41:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 18:41:28,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:28,954 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:28,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:41:29,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:41:29,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:29,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash -413203070, now seen corresponding path program 1 times [2025-03-03 18:41:29,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:41:29,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98443431] [2025-03-03 18:41:29,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:29,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:41:29,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:41:29,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:41:29,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 18:41:29,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:41:29,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:41:29,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:29,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:29,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 18:41:29,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:41:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 18:41:33,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:41:33,569 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:41:33,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98443431] [2025-03-03 18:41:33,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98443431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:41:33,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:41:33,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:41:33,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042678687] [2025-03-03 18:41:33,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:41:33,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:41:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:41:33,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:41:33,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:41:33,575 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 18:41:35,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 18:41:39,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 18:41:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:39,290 INFO L93 Difference]: Finished difference Result 166 states and 250 transitions. [2025-03-03 18:41:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:41:39,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2025-03-03 18:41:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:39,333 INFO L225 Difference]: With dead ends: 166 [2025-03-03 18:41:39,333 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 18:41:39,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:41:39,334 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 46 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:39,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 229 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-03 18:41:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 18:41:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2025-03-03 18:41:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 18:41:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 146 transitions. [2025-03-03 18:41:39,349 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 146 transitions. Word has length 132 [2025-03-03 18:41:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:39,349 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 146 transitions. [2025-03-03 18:41:39,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 18:41:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 146 transitions. [2025-03-03 18:41:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 18:41:39,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:39,351 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:39,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 18:41:39,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:41:39,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:39,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash -609716575, now seen corresponding path program 1 times [2025-03-03 18:41:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:41:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830304088] [2025-03-03 18:41:39,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:39,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:41:39,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:41:39,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:41:39,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 18:41:39,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:41:39,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:41:39,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:39,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:39,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 18:41:39,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:42:38,709 WARN L286 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 18:42:48,348 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)