./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:22:19,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:22:19,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:22:19,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:22:19,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:22:19,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:22:19,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:22:19,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:22:19,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:22:19,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:22:19,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:22:19,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:22:19,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:22:19,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:22:19,194 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:22:19,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:22:19,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:22:19,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:22:19,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:22:19,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:22:19,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:22:19,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:22:19,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:22:19,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:22:19,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:22:19,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:22:19,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:22:19,196 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-jdk21/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 -> 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 [2025-02-05 20:22:19,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:22:19,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:22:19,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:22:19,454 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:22:19,454 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:22:19,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2025-02-05 20:22:20,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4865feaca/e86e87822641461d9447f77ca83ff1b7/FLAG949d9caa4 [2025-02-05 20:22:20,924 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:22:20,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2025-02-05 20:22:20,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4865feaca/e86e87822641461d9447f77ca83ff1b7/FLAG949d9caa4 [2025-02-05 20:22:21,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4865feaca/e86e87822641461d9447f77ca83ff1b7 [2025-02-05 20:22:21,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:22:21,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:22:21,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:22:21,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:22:21,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:22:21,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51eca627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21, skipping insertion in model container [2025-02-05 20:22:21,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:22:21,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i[919,932] [2025-02-05 20:22:21,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:22:21,406 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:22:21,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i[919,932] [2025-02-05 20:22:21,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:22:21,444 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:22:21,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21 WrapperNode [2025-02-05 20:22:21,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:22:21,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:22:21,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:22:21,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:22:21,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,477 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-02-05 20:22:21,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:22:21,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:22:21,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:22:21,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:22:21,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,505 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-02-05 20:22:21,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:22:21,523 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:22:21,523 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:22:21,523 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:22:21,524 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (1/1) ... [2025-02-05 20:22:21,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:22:21,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:22:21,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:22:21,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:22:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:22:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:22:21,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:22:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:22:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:22:21,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:22:21,622 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:22:21,623 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:22:21,842 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:22:21,843 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:22:21,850 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:22:21,850 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:22:21,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:22:21 BoogieIcfgContainer [2025-02-05 20:22:21,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:22:21,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:22:21,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:22:21,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:22:21,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:22:21" (1/3) ... [2025-02-05 20:22:21,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcb4983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:22:21, skipping insertion in model container [2025-02-05 20:22:21,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:21" (2/3) ... [2025-02-05 20:22:21,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcb4983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:22:21, skipping insertion in model container [2025-02-05 20:22:21,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:22:21" (3/3) ... [2025-02-05 20:22:21,858 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-54.i [2025-02-05 20:22:21,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:22:21,869 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-54.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:22:21,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:22:21,924 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;@31146aa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:22:21,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:22:21,928 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-02-05 20:22:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 20:22:21,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:22:21,936 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, 1] [2025-02-05 20:22:21,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:22:21,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:22:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash -889886170, now seen corresponding path program 1 times [2025-02-05 20:22:21,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:22:21,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975390273] [2025-02-05 20:22:21,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:22:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:22:22,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 20:22:22,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 20:22:22,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:22:22,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:22:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-05 20:22:22,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:22:22,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975390273] [2025-02-05 20:22:22,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975390273] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:22:22,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180041333] [2025-02-05 20:22:22,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:22:22,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:22:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:22:22,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:22:22,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:22:22,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 20:22:22,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 20:22:22,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:22:22,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:22:22,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:22:22,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:22:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-05 20:22:22,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:22:22,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180041333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:22:22,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:22:22,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:22:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012895974] [2025-02-05 20:22:22,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:22:22,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:22:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:22:22,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:22:22,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:22:22,453 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.5) internal successors, (33), 2 states have internal predecessors, (33), 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-02-05 20:22:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:22:22,468 INFO L93 Difference]: Finished difference Result 114 states and 196 transitions. [2025-02-05 20:22:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:22:22,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 133 [2025-02-05 20:22:22,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:22:22,473 INFO L225 Difference]: With dead ends: 114 [2025-02-05 20:22:22,473 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 20:22:22,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:22:22,477 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-02-05 20:22:22,477 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-02-05 20:22:22,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 20:22:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-05 20:22:22,502 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-02-05 20:22:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2025-02-05 20:22:22,506 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 133 [2025-02-05 20:22:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:22:22,506 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2025-02-05 20:22:22,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-02-05 20:22:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2025-02-05 20:22:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 20:22:22,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:22:22,509 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, 1] [2025-02-05 20:22:22,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:22:22,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:22:22,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:22:22,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:22:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash -385346171, now seen corresponding path program 1 times [2025-02-05 20:22:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:22:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214322331] [2025-02-05 20:22:22,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:22:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:22:22,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 20:22:22,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 20:22:22,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:22:22,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:22:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 20:22:23,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:22:23,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214322331] [2025-02-05 20:22:23,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214322331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:22:23,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:22:23,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:22:23,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167740104] [2025-02-05 20:22:23,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:22:23,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:22:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:22:23,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:22:23,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:22:23,170 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-02-05 20:22:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:22:23,341 INFO L93 Difference]: Finished difference Result 166 states and 250 transitions. [2025-02-05 20:22:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:22:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 133 [2025-02-05 20:22:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:22:23,343 INFO L225 Difference]: With dead ends: 166 [2025-02-05 20:22:23,343 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 20:22:23,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:22:23,345 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:22:23,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 238 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:22:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 20:22:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2025-02-05 20:22:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 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-02-05 20:22:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2025-02-05 20:22:23,365 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 133 [2025-02-05 20:22:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:22:23,366 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2025-02-05 20:22:23,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-02-05 20:22:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2025-02-05 20:22:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 20:22:23,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:22:23,370 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, 1, 1] [2025-02-05 20:22:23,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:22:23,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:22:23,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:22:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1133213058, now seen corresponding path program 1 times [2025-02-05 20:22:23,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:22:23,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630675648] [2025-02-05 20:22:23,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:22:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:22:23,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 20:22:23,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 20:22:23,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:22:23,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:22:23,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479029982] [2025-02-05 20:22:23,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:22:23,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:22:23,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:22:23,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:22:23,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:22:23,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 20:22:23,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 20:22:23,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:22:23,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:22:23,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:22:23,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 20:22:23,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 20:22:23,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:22:23,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:22:23,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:22:23,899 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:22:23,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:22:23,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:22:24,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:22:24,104 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-05 20:22:24,183 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:22:24,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:22:24 BoogieIcfgContainer [2025-02-05 20:22:24,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:22:24,187 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:22:24,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:22:24,187 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:22:24,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:22:21" (3/4) ... [2025-02-05 20:22:24,190 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:22:24,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:22:24,192 INFO L158 Benchmark]: Toolchain (without parser) took 2968.06ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 104.4MB in the end (delta: 1.6MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2025-02-05 20:22:24,193 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:22:24,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.86ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 91.5MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:22:24,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.52ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:22:24,194 INFO L158 Benchmark]: Boogie Preprocessor took 42.28ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:22:24,194 INFO L158 Benchmark]: IcfgBuilder took 327.34ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 69.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:22:24,194 INFO L158 Benchmark]: TraceAbstraction took 2334.55ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 104.4MB in the end (delta: -35.8MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2025-02-05 20:22:24,194 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 104.4MB in the end (delta: 32.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:22:24,195 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.29ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.86ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 91.5MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.52ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.28ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 327.34ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 69.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2334.55ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 104.4MB in the end (delta: -35.8MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 104.4MB in the end (delta: 32.3kB). 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 120, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] unsigned char last_1_var_1_9 = 1; VAL [isInitial=0, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L83] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L84] var_1_5 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=100, var_1_9=1] [L85] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=100, var_1_9=1] [L86] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=100, var_1_9=1] [L86] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=100, var_1_9=1] [L87] var_1_8 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L88] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L89] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L89] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L90] var_1_10 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L92] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L93] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L94] var_1_11 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L95] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L96] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L97] var_1_12 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L98] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L99] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L101] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L102] var_1_16 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L103] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L104] var_1_17 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L105] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L106] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L107] var_1_19 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L108] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L109] var_1_20 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L110] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L111] var_1_21 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L112] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L113] var_1_22 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L114] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L128] RET updateVariables() [L129] CALL step() [L45] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_4=3, var_1_5=3, var_1_6=25, var_1_8=1, var_1_9=1] [L46] COND TRUE var_1_5 == var_1_4 [L47] var_1_6 = ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=33/4, var_1_1=-4, var_1_4=3, var_1_5=3, var_1_6=2, var_1_8=1, var_1_9=1] [L54] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L61] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_4=3, var_1_5=3, var_1_6=2, var_1_8=1, var_1_9=1] [L63] COND TRUE var_1_18 > var_1_18 [L64] var_1_1 = ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-6442450944, var_1_18=2, var_1_19=2, var_1_1=1, var_1_4=3, var_1_5=3, var_1_6=2, var_1_8=1, var_1_9=1] [L68] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L69] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-6442450948, var_1_17=-6442450944, var_1_18=2, var_1_19=2, var_1_1=1, var_1_4=3, var_1_5=3, var_1_6=2, var_1_8=1, var_1_9=1] [L71] COND TRUE ((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5))) [L72] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-6442450948, var_1_17=-6442450944, var_1_18=2, var_1_19=2, var_1_1=1, var_1_4=3, var_1_5=3, var_1_6=2, var_1_8=1, var_1_9=1] [L74] COND TRUE ((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14 [L75] var_1_9 = ((! var_1_11) || var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-6442450948, var_1_17=-6442450944, var_1_18=2, var_1_19=2, var_1_1=1, var_1_4=3, var_1_5=3, var_1_6=2, var_1_8=1, var_1_9=0] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-6442450948, var_1_17=-6442450944, var_1_18=2, var_1_19=2, var_1_1=1, var_1_4=3, var_1_5=3, var_1_6=2, var_1_8=1, var_1_9=0] [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-6442450948, var_1_17=-6442450944, var_1_18=2, var_1_19=2, var_1_1=1, var_1_4=3, var_1_5=3, var_1_6=2, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-6442450948, var_1_17=-6442450944, var_1_18=2, var_1_19=2, var_1_1=1, var_1_4=3, var_1_5=3, var_1_6=2, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 167 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 667 NumberOfCodeBlocks, 667 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2480/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-02-05 20:22:24,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:22:26,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:22:26,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:22:26,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:22:26,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:22:26,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:22:26,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:22:26,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:22:26,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:22:26,360 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:22:26,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:22:26,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:22:26,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:22:26,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:22:26,361 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:22:26,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:22:26,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:22:26,362 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:22:26,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:22:26,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:22:26,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:22:26,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:22:26,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:22:26,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:22:26,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:22:26,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:22:26,363 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:22:26,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:22:26,363 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:22:26,363 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:22:26,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:22:26,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:22:26,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:22:26,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:22:26,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:22:26,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:22:26,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:22:26,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:22:26,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:22:26,364 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:22:26,364 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:22:26,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:22:26,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:22:26,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:22:26,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:22:26,365 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-jdk21/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 -> 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 [2025-02-05 20:22:26,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:22:26,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:22:26,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:22:26,624 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:22:26,625 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:22:26,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2025-02-05 20:22:27,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73e5a6ff8/1b7b2970ef7b4a50a1e6030056a77cc0/FLAG50c91c730 [2025-02-05 20:22:28,020 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:22:28,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2025-02-05 20:22:28,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73e5a6ff8/1b7b2970ef7b4a50a1e6030056a77cc0/FLAG50c91c730 [2025-02-05 20:22:28,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73e5a6ff8/1b7b2970ef7b4a50a1e6030056a77cc0 [2025-02-05 20:22:28,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:22:28,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:22:28,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:22:28,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:22:28,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:22:28,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6452724c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28, skipping insertion in model container [2025-02-05 20:22:28,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:22:28,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i[919,932] [2025-02-05 20:22:28,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:22:28,243 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:22:28,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i[919,932] [2025-02-05 20:22:28,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:22:28,277 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:22:28,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28 WrapperNode [2025-02-05 20:22:28,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:22:28,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:22:28,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:22:28,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:22:28,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,313 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2025-02-05 20:22:28,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:22:28,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:22:28,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:22:28,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:22:28,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,335 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-02-05 20:22:28,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:22:28,355 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:22:28,355 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:22:28,355 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:22:28,356 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (1/1) ... [2025-02-05 20:22:28,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:22:28,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:22:28,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:22:28,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:22:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:22:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:22:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:22:28,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:22:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:22:28,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:22:28,479 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:22:28,481 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:22:34,337 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:22:34,337 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:22:34,348 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:22:34,349 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:22:34,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:22:34 BoogieIcfgContainer [2025-02-05 20:22:34,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:22:34,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:22:34,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:22:34,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:22:34,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:22:28" (1/3) ... [2025-02-05 20:22:34,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6723ec45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:22:34, skipping insertion in model container [2025-02-05 20:22:34,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:22:28" (2/3) ... [2025-02-05 20:22:34,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6723ec45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:22:34, skipping insertion in model container [2025-02-05 20:22:34,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:22:34" (3/3) ... [2025-02-05 20:22:34,386 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-54.i [2025-02-05 20:22:34,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:22:34,397 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-54.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:22:34,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:22:34,443 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;@2b08b636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:22:34,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:22:34,447 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-02-05 20:22:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 20:22:34,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:22:34,455 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, 1] [2025-02-05 20:22:34,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:22:34,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:22:34,459 INFO L85 PathProgramCache]: Analyzing trace with hash -889886170, now seen corresponding path program 1 times [2025-02-05 20:22:34,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:22:34,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612798759] [2025-02-05 20:22:34,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:22:34,471 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-02-05 20:22:34,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:22:34,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 20:22:34,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:22:34,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 20:22:34,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 20:22:34,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:22:34,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:22:34,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:22:34,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:22:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-05 20:22:34,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:22:34,847 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:22:34,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612798759] [2025-02-05 20:22:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612798759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:22:34,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:22:34,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:22:34,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088917204] [2025-02-05 20:22:34,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:22:34,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:22:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:22:34,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:22:34,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:22:34,872 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.5) internal successors, (35), 2 states have internal predecessors, (35), 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-02-05 20:22:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:22:34,893 INFO L93 Difference]: Finished difference Result 114 states and 196 transitions. [2025-02-05 20:22:34,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:22:34,896 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 133 [2025-02-05 20:22:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:22:34,901 INFO L225 Difference]: With dead ends: 114 [2025-02-05 20:22:34,901 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 20:22:34,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-02-05 20:22:34,908 INFO L435 NwaCegarLoop]: 84 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, 84 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-02-05 20:22:34,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:22:34,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 20:22:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-05 20:22:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 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-02-05 20:22:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-02-05 20:22:34,946 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 133 [2025-02-05 20:22:34,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:22:34,946 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-02-05 20:22:34,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-02-05 20:22:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-02-05 20:22:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 20:22:34,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:22:34,951 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, 1] [2025-02-05 20:22:34,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:22:35,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 20:22:35,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:22:35,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:22:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1357464164, now seen corresponding path program 1 times [2025-02-05 20:22:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:22:35,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697660983] [2025-02-05 20:22:35,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:22:35,155 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-02-05 20:22:35,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:22:35,157 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 20:22:35,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:22:35,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 20:22:35,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 20:22:35,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:22:35,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:22:35,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 20:22:35,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:22:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 20:22:36,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:22:36,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:22:36,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697660983] [2025-02-05 20:22:36,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697660983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:22:36,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:22:36,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:22:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950304408] [2025-02-05 20:22:36,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:22:36,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:22:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:22:36,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:22:36,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:22:36,384 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-02-05 20:22:39,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:22:42,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:22:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:22:42,298 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions. [2025-02-05 20:22:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:22:42,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 133 [2025-02-05 20:22:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:22:42,328 INFO L225 Difference]: With dead ends: 166 [2025-02-05 20:22:42,328 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 20:22:42,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:22:42,329 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:22:42,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 235 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-02-05 20:22:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 20:22:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2025-02-05 20:22:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 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-02-05 20:22:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2025-02-05 20:22:42,364 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 133 [2025-02-05 20:22:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:22:42,365 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2025-02-05 20:22:42,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-02-05 20:22:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2025-02-05 20:22:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 20:22:42,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:22:42,369 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, 1, 1] [2025-02-05 20:22:42,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-02-05 20:22:42,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-05 20:22:42,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:22:42,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:22:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1418943903, now seen corresponding path program 1 times [2025-02-05 20:22:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:22:42,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113614261] [2025-02-05 20:22:42,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:22:42,572 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-02-05 20:22:42,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:22:42,575 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-05 20:22:42,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:22:42,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 20:22:43,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 20:22:43,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:22:43,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:22:43,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 20:22:43,129 INFO L279 TraceCheckSpWp]: Computing forward predicates...