./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-93.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_loopvsstraightlinecode_50-1loop_file-93.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 a6e3d67206fd2623e470424823cb74f360f2f356142c755c5ecc566d5aee9c0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:42:54,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:42:54,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:42:54,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:42:54,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:42:54,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:42:54,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:42:54,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:42:54,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:42:54,095 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:42:54,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:42:54,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:42:54,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:42:54,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:42:54,095 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:42:54,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:42:54,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:42:54,096 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:42:54,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:42:54,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:42:54,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:42:54,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:42:54,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:42:54,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:42:54,096 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:42:54,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:42:54,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:42:54,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:42:54,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:42:54,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:42:54,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:42:54,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:42:54,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:42:54,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:42:54,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:42:54,097 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:42:54,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:42:54,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:42:54,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:42:54,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:42:54,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:42:54,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:42:54,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:42:54,098 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 -> a6e3d67206fd2623e470424823cb74f360f2f356142c755c5ecc566d5aee9c0f [2025-02-06 01:42:54,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:42:54,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:42:54,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:42:54,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:42:54,334 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:42:54,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-93.i [2025-02-06 01:42:55,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/292f2534a/5eaf5a25d6e34feaac3e704211e4a4b9/FLAG10e5b53a3 [2025-02-06 01:42:55,743 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:42:55,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-93.i [2025-02-06 01:42:55,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/292f2534a/5eaf5a25d6e34feaac3e704211e4a4b9/FLAG10e5b53a3 [2025-02-06 01:42:55,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/292f2534a/5eaf5a25d6e34feaac3e704211e4a4b9 [2025-02-06 01:42:55,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:42:55,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:42:55,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:42:55,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:42:55,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:42:55,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:42:55" (1/1) ... [2025-02-06 01:42:55,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3acda5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:55, skipping insertion in model container [2025-02-06 01:42:55,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:42:55" (1/1) ... [2025-02-06 01:42:55,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:42:55,910 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_loopvsstraightlinecode_50-1loop_file-93.i[915,928] [2025-02-06 01:42:55,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:42:55,976 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:42:55,984 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_loopvsstraightlinecode_50-1loop_file-93.i[915,928] [2025-02-06 01:42:56,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:42:56,033 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:42:56,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56 WrapperNode [2025-02-06 01:42:56,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:42:56,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:42:56,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:42:56,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:42:56,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,075 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2025-02-06 01:42:56,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:42:56,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:42:56,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:42:56,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:42:56,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,104 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-06 01:42:56,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:42:56,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:42:56,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:42:56,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:42:56,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (1/1) ... [2025-02-06 01:42:56,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:42:56,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:42:56,152 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-06 01:42:56,157 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-06 01:42:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:42:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:42:56,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:42:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:42:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:42:56,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:42:56,239 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:42:56,240 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:42:56,469 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-06 01:42:56,469 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:42:56,480 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:42:56,482 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:42:56,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:56 BoogieIcfgContainer [2025-02-06 01:42:56,483 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:42:56,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:42:56,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:42:56,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:42:56,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:42:55" (1/3) ... [2025-02-06 01:42:56,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48734fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:42:56, skipping insertion in model container [2025-02-06 01:42:56,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:56" (2/3) ... [2025-02-06 01:42:56,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48734fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:42:56, skipping insertion in model container [2025-02-06 01:42:56,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:56" (3/3) ... [2025-02-06 01:42:56,491 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-93.i [2025-02-06 01:42:56,503 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:42:56,504 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-93.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:42:56,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:42:56,560 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;@c51683e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:42:56,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:42:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:42:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:42:56,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:56,575 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:56,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:56,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:56,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1569840528, now seen corresponding path program 1 times [2025-02-06 01:42:56,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:56,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120757980] [2025-02-06 01:42:56,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:56,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:56,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:56,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:56,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:56,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 01:42:56,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:56,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120757980] [2025-02-06 01:42:56,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120757980] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:42:56,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890918575] [2025-02-06 01:42:56,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:56,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:42:56,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:42:56,844 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-06 01:42:56,846 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-06 01:42:56,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:57,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:57,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:57,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:57,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:42:57,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:42:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 01:42:57,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:42:57,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890918575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:57,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:42:57,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:42:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652807372] [2025-02-06 01:42:57,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:57,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:42:57,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:57,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:42:57,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:42:57,089 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:42:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:57,109 INFO L93 Difference]: Finished difference Result 143 states and 245 transitions. [2025-02-06 01:42:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:42:57,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-02-06 01:42:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:57,116 INFO L225 Difference]: With dead ends: 143 [2025-02-06 01:42:57,116 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 01:42:57,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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-06 01:42:57,121 INFO L435 NwaCegarLoop]: 109 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, 109 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-06 01:42:57,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:42:57,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 01:42:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-06 01:42:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:42:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-02-06 01:42:57,163 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 164 [2025-02-06 01:42:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:57,163 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-02-06 01:42:57,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:42:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-02-06 01:42:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:42:57,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:57,170 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:57,178 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-06 01:42:57,371 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-06 01:42:57,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:57,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1763636084, now seen corresponding path program 1 times [2025-02-06 01:42:57,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:57,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382631593] [2025-02-06 01:42:57,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:57,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:57,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:57,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:57,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:57,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:42:57,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:57,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382631593] [2025-02-06 01:42:57,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382631593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:57,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:57,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:42:57,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894110899] [2025-02-06 01:42:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:57,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:42:57,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:57,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:42:57,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:42:57,568 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:42:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:57,637 INFO L93 Difference]: Finished difference Result 169 states and 253 transitions. [2025-02-06 01:42:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:42:57,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-02-06 01:42:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:57,640 INFO L225 Difference]: With dead ends: 169 [2025-02-06 01:42:57,640 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 01:42:57,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:42:57,642 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:57,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 192 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:42:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 01:42:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2025-02-06 01:42:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 01:42:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2025-02-06 01:42:57,658 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 164 [2025-02-06 01:42:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:57,659 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2025-02-06 01:42:57,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:42:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2025-02-06 01:42:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 01:42:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:57,662 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:57,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:42:57,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1465751092, now seen corresponding path program 1 times [2025-02-06 01:42:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214914077] [2025-02-06 01:42:57,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:57,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 01:42:57,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 01:42:57,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:57,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:42:57,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:42:57,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 01:42:57,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 01:42:57,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:57,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:42:57,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:42:57,995 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:42:57,996 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:42:57,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:42:58,001 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 01:42:58,078 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:42:58,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:42:58 BoogieIcfgContainer [2025-02-06 01:42:58,082 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:42:58,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:42:58,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:42:58,083 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:42:58,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:56" (3/4) ... [2025-02-06 01:42:58,085 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:42:58,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:42:58,086 INFO L158 Benchmark]: Toolchain (without parser) took 2309.02ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 75.0MB in the end (delta: 31.7MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2025-02-06 01:42:58,087 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:42:58,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.56ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 92.2MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:42:58,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.25ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:42:58,088 INFO L158 Benchmark]: Boogie Preprocessor took 43.01ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:42:58,088 INFO L158 Benchmark]: IcfgBuilder took 359.84ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 68.1MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 01:42:58,088 INFO L158 Benchmark]: TraceAbstraction took 1598.04ms. Allocated memory is still 142.6MB. Free memory was 68.1MB in the beginning and 75.0MB in the end (delta: -6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:42:58,089 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 75.0MB in the end (delta: 37.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:42:58,090 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.23ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.56ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 92.2MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.25ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.01ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 359.84ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 68.1MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1598.04ms. Allocated memory is still 142.6MB. Free memory was 68.1MB in the beginning and 75.0MB in the end (delta: -6.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 75.0MB in the end (delta: 37.0kB). Peak memory consumption was 8.4MB. 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 97, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.5; [L23] float var_1_5 = 0.0; [L24] float var_1_6 = 4.2; [L25] float var_1_7 = 31.25; [L26] float var_1_8 = 1.375; [L27] unsigned short int var_1_9 = 32; [L28] unsigned char var_1_10 = 1; [L29] float var_1_11 = 0.625; [L30] unsigned short int var_1_12 = 1; [L31] float var_1_13 = -0.25; [L32] signed short int var_1_14 = 4; [L33] unsigned char var_1_15 = 1; [L34] unsigned char var_1_16 = 0; [L35] signed short int var_1_17 = 8; [L36] signed short int var_1_18 = 5; [L37] signed short int var_1_19 = 128; [L38] signed long int var_1_20 = -50; [L39] signed short int var_1_21 = -16; [L40] signed short int var_1_22 = 16; [L41] signed short int var_1_23 = 32; [L42] signed short int var_1_24 = 2; [L43] signed short int var_1_25 = -4; VAL [isInitial=0, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L145] isInitial = 1 [L146] FCALL initially() [L147] int k_loop; [L148] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L148] COND TRUE k_loop < 1 [L149] FCALL updateLastVariables() [L150] CALL updateVariables() [L96] var_1_5 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L97] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L98] var_1_6 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L99] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L100] var_1_7 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_8=11/8, var_1_9=32] [L101] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_8=11/8, var_1_9=32] [L102] var_1_8 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L103] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L104] var_1_10 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L105] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L106] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L106] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L107] var_1_11 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L108] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L109] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L109] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L110] var_1_12 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L111] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L112] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L112] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L113] var_1_15 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L114] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L115] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L115] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L116] var_1_16 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L117] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L118] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L118] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L119] var_1_17 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_17 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L120] RET assume_abort_if_not(var_1_17 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L121] CALL assume_abort_if_not(var_1_17 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L121] RET assume_abort_if_not(var_1_17 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L122] var_1_18 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L123] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L124] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L124] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L125] var_1_19 = __VERIFIER_nondet_short() [L126] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L126] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L127] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L127] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L128] var_1_22 = __VERIFIER_nondet_short() [L129] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L129] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L130] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L130] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L131] var_1_24 = __VERIFIER_nondet_short() [L132] CALL assume_abort_if_not(var_1_24 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L132] RET assume_abort_if_not(var_1_24 >= -8192) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L133] CALL assume_abort_if_not(var_1_24 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L133] RET assume_abort_if_not(var_1_24 <= 8192) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L134] var_1_25 = __VERIFIER_nondet_short() [L135] CALL assume_abort_if_not(var_1_25 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L135] RET assume_abort_if_not(var_1_25 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L136] CALL assume_abort_if_not(var_1_25 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L136] RET assume_abort_if_not(var_1_25 <= 8191) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L150] RET updateVariables() [L151] CALL step() [L47] COND TRUE \read(var_1_10) [L48] var_1_13 = ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_9=32] [L52] unsigned char stepLocal_5 = ! (var_1_10 || var_1_15); VAL [isInitial=1, stepLocal_5=0, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_9=32] [L53] COND TRUE stepLocal_5 || var_1_16 [L54] var_1_14 = ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_9=32] [L56] COND TRUE \read(var_1_15) [L57] var_1_21 = ((var_1_22 + 25) - var_1_19) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-32741, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_9=32] [L59] COND TRUE \read(var_1_10) [L60] var_1_23 = (var_1_22 + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_25)) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-32741, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_9=32] [L68] unsigned char stepLocal_4 = var_1_13 < (var_1_8 / var_1_11); [L69] unsigned char stepLocal_3 = var_1_13 != var_1_11; VAL [isInitial=1, stepLocal_3=1, stepLocal_4=0, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-32741, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_9=32] [L70] COND TRUE var_1_10 || stepLocal_4 VAL [isInitial=1, stepLocal_3=1, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-32741, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_9=32] [L71] COND TRUE var_1_10 || stepLocal_3 [L72] var_1_9 = 8 VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-50, var_1_21=-32741, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_9=8] [L77] COND TRUE \read(var_1_16) [L78] var_1_20 = (var_1_9 - 50) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-42, var_1_21=-32741, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_9=8] [L80] signed short int stepLocal_2 = var_1_21; [L81] signed short int stepLocal_1 = var_1_21; [L82] signed long int stepLocal_0 = var_1_14 - var_1_20; VAL [isInitial=1, stepLocal_0=40, stepLocal_1=-32741, stepLocal_2=-32741, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=1/2, var_1_20=-42, var_1_21=-32741, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_9=8] [L83] COND FALSE !((var_1_20 + var_1_14) < stepLocal_2) [L92] var_1_1 = var_1_8 VAL [isInitial=1, stepLocal_0=40, stepLocal_1=-32741, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=65539, var_1_20=-42, var_1_21=-32741, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_8=65539, var_1_9=8] [L151] RET step() [L152] CALL, EXPR property() [L141-L142] return ((((((((var_1_20 + var_1_14) < var_1_21) ? ((var_1_21 <= (var_1_14 - var_1_20)) ? ((var_1_21 < var_1_14) ? (var_1_1 == ((float) ((var_1_5 - var_1_6) - var_1_7))) : 1) : (var_1_1 == ((float) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) + 3.25f)))) : (var_1_1 == ((float) var_1_8))) && ((var_1_10 || (var_1_13 < (var_1_8 / var_1_11))) ? ((var_1_10 || (var_1_13 != var_1_11)) ? (var_1_9 == ((unsigned short int) 8)) : 1) : (var_1_9 == ((unsigned short int) var_1_12)))) && (var_1_10 ? (var_1_13 == ((float) ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))))) : (var_1_13 == ((float) ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))))))) && (((! (var_1_10 || var_1_15)) || var_1_16) ? (var_1_14 == ((signed short int) ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))))) : 1)) && (var_1_16 ? (var_1_20 == ((signed long int) (var_1_9 - 50))) : 1)) && (var_1_15 ? (var_1_21 == ((signed short int) ((var_1_22 + 25) - var_1_19))) : 1)) && (var_1_10 ? (var_1_23 == ((signed short int) (var_1_22 + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_25)))) : (var_1_16 ? (var_1_23 == ((signed short int) var_1_24)) : (var_1_23 == ((signed short int) var_1_17)))) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=65539, var_1_20=-42, var_1_21=-32741, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_8=65539, var_1_9=8] [L152] RET, EXPR property() [L152] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=65539, var_1_20=-42, var_1_21=-32741, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_8=65539, var_1_9=8] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_12=65534, var_1_13=65540, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=32763, var_1_19=32766, var_1_1=65539, var_1_20=-42, var_1_21=-32741, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=65540, var_1_7=65540, var_1_8=65539, var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 301 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 210 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3850/3900 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-06 01:42:58,105 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_loopvsstraightlinecode_50-1loop_file-93.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 a6e3d67206fd2623e470424823cb74f360f2f356142c755c5ecc566d5aee9c0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:42:59,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:43:00,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:43:00,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:43:00,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:43:00,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:43:00,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:43:00,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:43:00,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:43:00,057 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:43:00,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:43:00,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:43:00,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:43:00,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:43:00,058 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:43:00,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:43:00,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:43:00,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:43:00,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:43:00,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:43:00,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:43:00,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:43:00,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:43:00,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:43:00,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:43:00,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:43:00,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:43:00,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:43:00,060 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:43:00,060 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:43:00,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:43:00,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:43:00,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:43:00,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:43:00,061 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 -> a6e3d67206fd2623e470424823cb74f360f2f356142c755c5ecc566d5aee9c0f [2025-02-06 01:43:00,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:43:00,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:43:00,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:43:00,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:43:00,309 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:43:00,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-93.i [2025-02-06 01:43:01,578 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f61a86cbe/c15c8551c5a247ccb70e508f432ed2ed/FLAG517dfeb85 [2025-02-06 01:43:01,785 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:43:01,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-93.i [2025-02-06 01:43:01,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f61a86cbe/c15c8551c5a247ccb70e508f432ed2ed/FLAG517dfeb85 [2025-02-06 01:43:01,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f61a86cbe/c15c8551c5a247ccb70e508f432ed2ed [2025-02-06 01:43:01,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:43:01,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:43:01,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:43:01,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:43:01,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:43:01,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:43:01" (1/1) ... [2025-02-06 01:43:01,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184066a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:01, skipping insertion in model container [2025-02-06 01:43:01,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:43:01" (1/1) ... [2025-02-06 01:43:01,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:43:01,956 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_loopvsstraightlinecode_50-1loop_file-93.i[915,928] [2025-02-06 01:43:02,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:43:02,013 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:43:02,022 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_loopvsstraightlinecode_50-1loop_file-93.i[915,928] [2025-02-06 01:43:02,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:43:02,053 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:43:02,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02 WrapperNode [2025-02-06 01:43:02,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:43:02,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:43:02,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:43:02,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:43:02,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,087 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2025-02-06 01:43:02,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:43:02,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:43:02,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:43:02,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:43:02,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,112 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-06 01:43:02,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:43:02,125 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:43:02,125 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:43:02,125 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:43:02,126 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (1/1) ... [2025-02-06 01:43:02,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:43:02,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:43:02,151 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-06 01:43:02,153 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-06 01:43:02,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:43:02,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:43:02,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:43:02,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:43:02,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:43:02,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:43:02,240 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:43:02,242 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:43:07,896 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-06 01:43:07,897 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:43:07,906 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:43:07,907 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:43:07,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:43:07 BoogieIcfgContainer [2025-02-06 01:43:07,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:43:07,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:43:07,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:43:07,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:43:07,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:43:01" (1/3) ... [2025-02-06 01:43:07,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7291300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:43:07, skipping insertion in model container [2025-02-06 01:43:07,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:02" (2/3) ... [2025-02-06 01:43:07,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7291300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:43:07, skipping insertion in model container [2025-02-06 01:43:07,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:43:07" (3/3) ... [2025-02-06 01:43:07,918 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-93.i [2025-02-06 01:43:07,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:43:07,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-93.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:43:07,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:43:07,985 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;@569daa76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:43:07,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:43:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:43:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:43:07,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:43:07,997 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:43:07,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:43:08,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:43:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1569840528, now seen corresponding path program 1 times [2025-02-06 01:43:08,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:43:08,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305998361] [2025-02-06 01:43:08,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:43:08,010 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-06 01:43:08,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:43:08,012 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-06 01:43:08,013 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-06 01:43:08,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:43:08,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:43:08,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:43:08,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:43:08,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:43:08,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:43:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2025-02-06 01:43:08,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:43:08,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:43:08,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305998361] [2025-02-06 01:43:08,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305998361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:43:08,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:43:08,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:43:08,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437864819] [2025-02-06 01:43:08,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:43:08,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:43:08,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:43:08,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:43:08,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:43:08,479 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:43:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:43:08,498 INFO L93 Difference]: Finished difference Result 143 states and 245 transitions. [2025-02-06 01:43:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:43:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-02-06 01:43:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:43:08,503 INFO L225 Difference]: With dead ends: 143 [2025-02-06 01:43:08,504 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 01:43:08,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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-06 01:43:08,508 INFO L435 NwaCegarLoop]: 109 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, 109 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-06 01:43:08,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:43:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 01:43:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-06 01:43:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:43:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-02-06 01:43:08,539 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 164 [2025-02-06 01:43:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:43:08,540 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-02-06 01:43:08,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:43:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-02-06 01:43:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:43:08,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:43:08,544 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:43:08,555 INFO L552 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)] Ended with exit code 0 [2025-02-06 01:43:08,745 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-06 01:43:08,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:43:08,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:43:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1763636084, now seen corresponding path program 1 times [2025-02-06 01:43:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:43:08,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978258885] [2025-02-06 01:43:08,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:43:08,747 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-06 01:43:08,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:43:08,749 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-06 01:43:08,750 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-06 01:43:08,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:43:09,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:43:09,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:43:09,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:43:09,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 01:43:09,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:43:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:43:09,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:43:09,184 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:43:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978258885] [2025-02-06 01:43:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978258885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:43:09,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:43:09,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:43:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572272561] [2025-02-06 01:43:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:43:09,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:43:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:43:09,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:43:09,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:43:09,186 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:43:13,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:43:17,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:43:17,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:43:17,120 INFO L93 Difference]: Finished difference Result 169 states and 253 transitions. [2025-02-06 01:43:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:43:17,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-02-06 01:43:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:43:17,157 INFO L225 Difference]: With dead ends: 169 [2025-02-06 01:43:17,157 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 01:43:17,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:43:17,158 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 37 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-02-06 01:43:17,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 192 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2025-02-06 01:43:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 01:43:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2025-02-06 01:43:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 01:43:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2025-02-06 01:43:17,180 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 164 [2025-02-06 01:43:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:43:17,180 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2025-02-06 01:43:17,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:43:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2025-02-06 01:43:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 01:43:17,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:43:17,184 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:43:17,199 INFO L552 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)] Ended with exit code 0 [2025-02-06 01:43:17,384 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-06 01:43:17,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:43:17,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:43:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1465751092, now seen corresponding path program 1 times [2025-02-06 01:43:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:43:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171763223] [2025-02-06 01:43:17,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:43:17,386 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-06 01:43:17,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:43:17,388 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-06 01:43:17,389 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-06 01:43:17,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 01:43:17,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 01:43:17,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:43:17,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:43:17,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 01:43:17,812 INFO L279 TraceCheckSpWp]: Computing forward predicates...