./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_fillercode_fillercodesize_normal_file-73.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 2884416ff292c4b713684b3affe0c9e5395d09878f2c24add1de527aeee527b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:10:55,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:10:55,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:10:55,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:10:55,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:10:55,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:10:55,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:10:55,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:10:55,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:10:55,918 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:10:55,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:10:55,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:10:55,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:10:55,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:10:55,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:10:55,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:10:55,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:10:55,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:10:55,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:10:55,920 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 -> 2884416ff292c4b713684b3affe0c9e5395d09878f2c24add1de527aeee527b6 [2025-01-09 09:10:56,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:10:56,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:10:56,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:10:56,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:10:56,142 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:10:56,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-73.i [2025-01-09 09:10:57,340 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb93fe85f/3a00ca9be6214985b0de2e04ca79ab3b/FLAGc0d012939 [2025-01-09 09:10:57,612 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:10:57,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-73.i [2025-01-09 09:10:57,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb93fe85f/3a00ca9be6214985b0de2e04ca79ab3b/FLAGc0d012939 [2025-01-09 09:10:57,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb93fe85f/3a00ca9be6214985b0de2e04ca79ab3b [2025-01-09 09:10:57,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:10:57,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:10:57,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:10:57,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:10:57,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:10:57,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:10:57" (1/1) ... [2025-01-09 09:10:57,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a33c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:57, skipping insertion in model container [2025-01-09 09:10:57,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:10:57" (1/1) ... [2025-01-09 09:10:57,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:10:58,084 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_fillercode_fillercodesize_normal_file-73.i[913,926] [2025-01-09 09:10:58,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:10:58,137 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:10:58,147 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_fillercode_fillercodesize_normal_file-73.i[913,926] [2025-01-09 09:10:58,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:10:58,179 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:10:58,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58 WrapperNode [2025-01-09 09:10:58,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:10:58,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:10:58,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:10:58,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:10:58,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,215 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-01-09 09:10:58,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:10:58,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:10:58,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:10:58,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:10:58,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,243 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-01-09 09:10:58,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:10:58,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:10:58,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:10:58,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:10:58,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (1/1) ... [2025-01-09 09:10:58,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:10:58,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:10:58,291 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-01-09 09:10:58,301 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-01-09 09:10:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:10:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:10:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:10:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:10:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:10:58,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:10:58,395 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:10:58,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:10:58,695 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 09:10:58,696 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:10:58,706 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:10:58,706 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:10:58,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:10:58 BoogieIcfgContainer [2025-01-09 09:10:58,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:10:58,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:10:58,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:10:58,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:10:58,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:10:57" (1/3) ... [2025-01-09 09:10:58,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323bbff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:10:58, skipping insertion in model container [2025-01-09 09:10:58,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:10:58" (2/3) ... [2025-01-09 09:10:58,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323bbff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:10:58, skipping insertion in model container [2025-01-09 09:10:58,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:10:58" (3/3) ... [2025-01-09 09:10:58,714 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-73.i [2025-01-09 09:10:58,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:10:58,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-73.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:10:58,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:10:58,783 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;@7297a192, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:10:58,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:10:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 09:10:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 09:10:58,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:10:58,794 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:10:58,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:10:58,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:10:58,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1908203776, now seen corresponding path program 1 times [2025-01-09 09:10:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:10:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350105309] [2025-01-09 09:10:58,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:10:58,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:10:58,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 09:10:58,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 09:10:58,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:10:58,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:10:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 09:10:59,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:10:59,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350105309] [2025-01-09 09:10:59,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350105309] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:10:59,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963965664] [2025-01-09 09:10:59,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:10:59,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:10:59,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:10:59,049 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-01-09 09:10:59,050 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-01-09 09:10:59,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 09:10:59,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 09:10:59,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:10:59,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:10:59,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:10:59,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:10:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 09:10:59,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:10:59,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963965664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:10:59,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:10:59,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:10:59,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104846506] [2025-01-09 09:10:59,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:10:59,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:10:59,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:10:59,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:10:59,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:10:59,268 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:10:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:10:59,292 INFO L93 Difference]: Finished difference Result 134 states and 224 transitions. [2025-01-09 09:10:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:10:59,295 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-01-09 09:10:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:10:59,300 INFO L225 Difference]: With dead ends: 134 [2025-01-09 09:10:59,301 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 09:10:59,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-01-09 09:10:59,308 INFO L435 NwaCegarLoop]: 99 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, 99 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-01-09 09:10:59,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:10:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 09:10:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 09:10:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 09:10:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2025-01-09 09:10:59,347 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 139 [2025-01-09 09:10:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:10:59,349 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2025-01-09 09:10:59,349 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:10:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2025-01-09 09:10:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 09:10:59,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:10:59,354 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:10:59,365 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-01-09 09:10:59,556 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-01-09 09:10:59,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:10:59,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:10:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash 562805950, now seen corresponding path program 1 times [2025-01-09 09:10:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:10:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549301062] [2025-01-09 09:10:59,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:10:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:10:59,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 09:10:59,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 09:10:59,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:10:59,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 09:11:00,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:11:00,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549301062] [2025-01-09 09:11:00,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549301062] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:11:00,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066659778] [2025-01-09 09:11:00,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:00,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:11:00,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:11:00,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:11:00,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:11:00,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 09:11:01,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 09:11:01,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:01,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:01,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 09:11:01,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:11:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 09:11:01,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:11:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 09:11:03,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066659778] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:11:03,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:11:03,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-01-09 09:11:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398055401] [2025-01-09 09:11:03,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:11:03,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:11:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:11:03,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:11:03,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:11:03,109 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 5 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) [2025-01-09 09:11:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:04,478 INFO L93 Difference]: Finished difference Result 356 states and 512 transitions. [2025-01-09 09:11:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 09:11:04,479 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 5 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) Word has length 139 [2025-01-09 09:11:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:04,482 INFO L225 Difference]: With dead ends: 356 [2025-01-09 09:11:04,482 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 09:11:04,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 09:11:04,483 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 491 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:11:04,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 657 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:11:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 09:11:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 202. [2025-01-09 09:11:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 124 states have (on average 1.2258064516129032) internal successors, (152), 125 states have internal predecessors, (152), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 09:11:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 296 transitions. [2025-01-09 09:11:04,525 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 296 transitions. Word has length 139 [2025-01-09 09:11:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:04,526 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 296 transitions. [2025-01-09 09:11:04,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 5 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) [2025-01-09 09:11:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 296 transitions. [2025-01-09 09:11:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 09:11:04,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:04,532 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:11:04,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 09:11:04,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:11:04,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:04,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2143813444, now seen corresponding path program 1 times [2025-01-09 09:11:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:11:04,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831050194] [2025-01-09 09:11:04,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:11:04,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 09:11:04,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 09:11:04,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:04,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:11:04,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:11:04,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 09:11:04,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 09:11:04,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:04,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:11:04,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:11:04,912 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:11:04,913 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:11:04,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:11:04,916 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 09:11:04,971 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:11:04,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:11:04 BoogieIcfgContainer [2025-01-09 09:11:04,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:11:04,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:11:04,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:11:04,974 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:11:04,975 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:10:58" (3/4) ... [2025-01-09 09:11:04,976 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:11:04,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:11:04,977 INFO L158 Benchmark]: Toolchain (without parser) took 7041.30ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 105.1MB in the beginning and 169.3MB in the end (delta: -64.2MB). Peak memory consumption was 142.5MB. Max. memory is 16.1GB. [2025-01-09 09:11:04,977 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:11:04,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.64ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 90.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:11:04,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.23ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 88.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:11:04,978 INFO L158 Benchmark]: Boogie Preprocessor took 45.03ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 85.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:11:04,978 INFO L158 Benchmark]: RCFGBuilder took 444.95ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 65.7MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:11:04,978 INFO L158 Benchmark]: TraceAbstraction took 6265.54ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 64.8MB in the beginning and 169.4MB in the end (delta: -104.6MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. [2025-01-09 09:11:04,979 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 343.9MB. Free memory was 169.4MB in the beginning and 169.3MB in the end (delta: 106.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:11:04,980 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.64ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 90.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.23ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 88.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.03ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 85.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 444.95ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 65.7MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6265.54ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 64.8MB in the beginning and 169.4MB in the end (delta: -104.6MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 343.9MB. Free memory was 169.4MB in the beginning and 169.3MB in the end (delta: 106.2kB). 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 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 7.325; [L23] double var_1_3 = 63.8; [L24] double var_1_4 = 256.6; [L25] double var_1_5 = 2.375; [L26] double var_1_6 = 25.8; [L27] unsigned char var_1_7 = 1; [L28] double var_1_8 = 1.5; [L29] unsigned long int var_1_9 = 32; [L30] unsigned long int var_1_10 = 3567543019; [L31] float var_1_12 = 31.875; [L32] signed long int var_1_13 = 128; [L33] unsigned char var_1_16 = 4; [L34] unsigned char var_1_18 = 16; [L35] signed long int var_1_19 = 64; [L36] unsigned char var_1_20 = 0; [L37] signed long int var_1_21 = 1897833385; [L38] unsigned char var_1_22 = 2; [L39] signed char var_1_23 = -5; [L40] signed char var_1_24 = -4; [L41] signed char var_1_25 = 2; [L42] signed long int var_1_26 = -1000000; [L43] float last_1_var_1_12 = 31.875; [L44] signed long int last_1_var_1_13 = 128; [L45] unsigned char last_1_var_1_16 = 4; [L46] signed long int last_1_var_1_19 = 64; VAL [isInitial=0, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_3=319/5, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L135] isInitial = 1 [L136] FCALL initially() [L138] CALL updateLastVariables() [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_13 = var_1_13 [L127] last_1_var_1_16 = var_1_16 [L128] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_3=319/5, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L90] var_1_3 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L91] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L92] var_1_4 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L93] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L94] var_1_5 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L95] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L96] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L96] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L97] var_1_6 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L98] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L99] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L99] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L100] var_1_7 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_8=3/2, var_1_9=32] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_8=3/2, var_1_9=32] [L102] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L102] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L103] var_1_8 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L104] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L105] var_1_10 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_10 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L106] RET assume_abort_if_not(var_1_10 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L107] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L107] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L108] var_1_18 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L109] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L110] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L110] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L111] var_1_20 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L112] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L113] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L113] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L114] var_1_21 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_21 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L115] RET assume_abort_if_not(var_1_21 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L116] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L116] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L117] var_1_24 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_24 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L118] RET assume_abort_if_not(var_1_24 >= -126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L119] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L119] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L120] var_1_25 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_25 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L121] RET assume_abort_if_not(var_1_25 >= -126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L122] CALL assume_abort_if_not(var_1_25 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L122] RET assume_abort_if_not(var_1_25 <= 126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L139] RET updateVariables() [L140] CALL step() [L50] COND TRUE (((((last_1_var_1_19 / 2)) > ((~ last_1_var_1_16))) ? ((last_1_var_1_19 / 2)) : ((~ last_1_var_1_16)))) <= var_1_10 [L51] var_1_12 = var_1_8 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L53] COND FALSE !(var_1_12 > ((var_1_3 - var_1_4) / ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) [L60] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L62] COND TRUE var_1_3 >= (last_1_var_1_12 * var_1_4) [L63] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L65] var_1_22 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L66] COND TRUE var_1_1 > var_1_5 [L67] var_1_23 = (((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) < 0 ) ? -((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) : ((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L71] var_1_26 = var_1_25 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L72] EXPR var_1_26 >> var_1_10 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L72] signed long int stepLocal_0 = var_1_26 >> var_1_10; [L73] COND TRUE stepLocal_0 < last_1_var_1_13 [L74] var_1_13 = ((((var_1_26) < (var_1_22)) ? (var_1_26) : (var_1_22))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L76] COND TRUE var_1_1 < (var_1_4 - var_1_3) [L77] var_1_9 = (var_1_10 - var_1_16) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L79] COND TRUE var_1_7 && var_1_20 [L80] var_1_19 = ((1827081742 - var_1_13) - (var_1_21 - (var_1_18 + var_1_16))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR ((((var_1_12 > ((var_1_3 - var_1_4) / ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_7 ? (var_1_1 == ((double) var_1_8)) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_8))) && ((var_1_1 < (var_1_4 - var_1_3)) ? (var_1_9 == ((unsigned long int) (var_1_10 - var_1_16))) : 1)) && (((((((last_1_var_1_19 / 2)) > ((~ last_1_var_1_16))) ? ((last_1_var_1_19 / 2)) : ((~ last_1_var_1_16)))) <= var_1_10) ? (var_1_12 == ((float) var_1_8)) : 1)) && (((var_1_26 >> var_1_10) < last_1_var_1_13) ? (var_1_13 == ((signed long int) ((((var_1_26) < (var_1_22)) ? (var_1_26) : (var_1_22))))) : 1) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L131-L132] return (((((((((var_1_12 > ((var_1_3 - var_1_4) / ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_7 ? (var_1_1 == ((double) var_1_8)) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_8))) && ((var_1_1 < (var_1_4 - var_1_3)) ? (var_1_9 == ((unsigned long int) (var_1_10 - var_1_16))) : 1)) && (((((((last_1_var_1_19 / 2)) > ((~ last_1_var_1_16))) ? ((last_1_var_1_19 / 2)) : ((~ last_1_var_1_16)))) <= var_1_10) ? (var_1_12 == ((float) var_1_8)) : 1)) && (((var_1_26 >> var_1_10) < last_1_var_1_13) ? (var_1_13 == ((signed long int) ((((var_1_26) < (var_1_22)) ? (var_1_26) : (var_1_22))))) : 1)) && ((var_1_3 >= (last_1_var_1_12 * var_1_4)) ? (var_1_16 == ((unsigned char) var_1_18)) : 1)) && ((var_1_7 && var_1_20) ? (var_1_19 == ((signed long int) ((1827081742 - var_1_13) - (var_1_21 - (var_1_18 + var_1_16))))) : ((2u >= ((((var_1_21) > (var_1_9)) ? (var_1_21) : (var_1_9)))) ? (var_1_19 == ((signed long int) var_1_22)) : (var_1_19 == ((signed long int) var_1_22))))) && (var_1_22 == ((unsigned char) ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))))) && ((var_1_1 > var_1_5) ? (var_1_23 == ((signed char) (((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) < 0 ) ? -((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) : ((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) : (var_1_23 == ((signed char) var_1_24)))) && (var_1_26 == ((signed long int) var_1_25)) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 491 mSDsluCounter, 756 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 568 mSDsCounter, 301 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 732 IncrementalHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 301 mSolverCounterUnsat, 188 mSDtfsCounter, 732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=2, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 90 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 3536 SizeOfPredicates, 3 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4061/4200 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-01-09 09:11:04,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_fillercode_fillercodesize_normal_file-73.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 2884416ff292c4b713684b3affe0c9e5395d09878f2c24add1de527aeee527b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:11:07,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:11:07,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:11:07,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:11:07,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:11:07,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:11:07,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:11:07,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:11:07,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:11:07,182 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:11:07,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:11:07,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:11:07,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:11:07,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:11:07,183 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:11:07,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:11:07,184 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:11:07,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:11:07,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:11:07,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:11:07,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:11:07,185 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 -> 2884416ff292c4b713684b3affe0c9e5395d09878f2c24add1de527aeee527b6 [2025-01-09 09:11:07,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:11:07,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:11:07,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:11:07,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:11:07,443 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:11:07,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-73.i [2025-01-09 09:11:08,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf57a39aa/a356c46f45764941a993bd70aa21edea/FLAG2bd4587bb [2025-01-09 09:11:08,816 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:11:08,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-73.i [2025-01-09 09:11:08,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf57a39aa/a356c46f45764941a993bd70aa21edea/FLAG2bd4587bb [2025-01-09 09:11:08,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf57a39aa/a356c46f45764941a993bd70aa21edea [2025-01-09 09:11:08,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:11:08,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:11:08,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:11:08,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:11:08,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:11:08,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:11:08" (1/1) ... [2025-01-09 09:11:08,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ffec8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:08, skipping insertion in model container [2025-01-09 09:11:08,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:11:08" (1/1) ... [2025-01-09 09:11:08,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:11:08,971 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_fillercode_fillercodesize_normal_file-73.i[913,926] [2025-01-09 09:11:09,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:11:09,031 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:11:09,039 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_fillercode_fillercodesize_normal_file-73.i[913,926] [2025-01-09 09:11:09,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:11:09,085 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:11:09,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09 WrapperNode [2025-01-09 09:11:09,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:11:09,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:11:09,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:11:09,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:11:09,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,123 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-01-09 09:11:09,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:11:09,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:11:09,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:11:09,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:11:09,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,148 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-01-09 09:11:09,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:11:09,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:11:09,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:11:09,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:11:09,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (1/1) ... [2025-01-09 09:11:09,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:11:09,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:11:09,203 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-01-09 09:11:09,214 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-01-09 09:11:09,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:11:09,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:11:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:11:09,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:11:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:11:09,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:11:09,292 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:11:09,293 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:11:29,562 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 09:11:29,563 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:11:29,571 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:11:29,572 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:11:29,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:11:29 BoogieIcfgContainer [2025-01-09 09:11:29,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:11:29,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:11:29,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:11:29,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:11:29,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:11:08" (1/3) ... [2025-01-09 09:11:29,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337c79f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:11:29, skipping insertion in model container [2025-01-09 09:11:29,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:09" (2/3) ... [2025-01-09 09:11:29,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337c79f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:11:29, skipping insertion in model container [2025-01-09 09:11:29,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:11:29" (3/3) ... [2025-01-09 09:11:29,581 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-73.i [2025-01-09 09:11:29,591 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:11:29,592 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-73.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:11:29,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:11:29,651 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;@8c63b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:11:29,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:11:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 09:11:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 09:11:29,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:29,664 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:11:29,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:29,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1354739497, now seen corresponding path program 1 times [2025-01-09 09:11:29,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:11:29,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291901288] [2025-01-09 09:11:29,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:29,681 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-01-09 09:11:29,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:11:29,683 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-01-09 09:11:29,687 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-01-09 09:11:29,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:11:30,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:11:30,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:30,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:30,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:11:30,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:11:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-01-09 09:11:30,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:11:30,752 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:11:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291901288] [2025-01-09 09:11:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291901288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:11:30,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:11:30,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:11:30,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425972846] [2025-01-09 09:11:30,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:11:30,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:11:30,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:11:30,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:11:30,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:11:30,780 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:11:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:30,796 INFO L93 Difference]: Finished difference Result 118 states and 202 transitions. [2025-01-09 09:11:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:11:30,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2025-01-09 09:11:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:30,801 INFO L225 Difference]: With dead ends: 118 [2025-01-09 09:11:30,801 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 09:11:30,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:11:30,805 INFO L435 NwaCegarLoop]: 88 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, 88 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-01-09 09:11:30,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:11:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 09:11:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 09:11:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 09:11:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2025-01-09 09:11:30,831 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 135 [2025-01-09 09:11:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:30,831 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-01-09 09:11:30,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:11:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2025-01-09 09:11:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 09:11:30,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:30,835 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:11:30,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:11:31,039 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-01-09 09:11:31,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:31,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1621222937, now seen corresponding path program 1 times [2025-01-09 09:11:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:11:31,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088858219] [2025-01-09 09:11:31,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:31,040 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-01-09 09:11:31,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:11:31,043 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-01-09 09:11:31,044 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-01-09 09:11:31,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:11:31,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:11:31,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:31,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:32,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:11:32,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:11:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 09:11:36,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:11:37,212 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:11:37,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088858219] [2025-01-09 09:11:37,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088858219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:11:37,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [538166830] [2025-01-09 09:11:37,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:37,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 09:11:37,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 09:11:37,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 09:11:37,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 09:11:37,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:11:38,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:11:38,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:38,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:38,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 09:11:38,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:11:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 09:11:41,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:11:41,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [538166830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:11:41,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:11:41,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-09 09:11:41,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776705714] [2025-01-09 09:11:41,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:11:41,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:11:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:11:41,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:11:41,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:11:41,984 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:11:47,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:11:51,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 09:11:54,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:11:58,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 09:11:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:59,040 INFO L93 Difference]: Finished difference Result 172 states and 259 transitions. [2025-01-09 09:11:59,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:11:59,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2025-01-09 09:11:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:59,088 INFO L225 Difference]: With dead ends: 172 [2025-01-09 09:11:59,088 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 09:11:59,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:11:59,089 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:11:59,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 286 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 16.8s Time] [2025-01-09 09:11:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 09:11:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2025-01-09 09:11:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 09:11:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 160 transitions. [2025-01-09 09:11:59,132 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 160 transitions. Word has length 135 [2025-01-09 09:11:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:59,132 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 160 transitions. [2025-01-09 09:11:59,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:11:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 160 transitions. [2025-01-09 09:11:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 09:11:59,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:59,136 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:11:59,181 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-01-09 09:11:59,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-01-09 09:11:59,541 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 09:11:59,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:59,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash 898736997, now seen corresponding path program 1 times [2025-01-09 09:11:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:11:59,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633499226] [2025-01-09 09:11:59,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:59,545 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-01-09 09:11:59,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:11:59,547 INFO L229 MonitoredProcess]: Starting monitored process 5 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-01-09 09:11:59,548 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 (5)] Waiting until timeout for monitored process [2025-01-09 09:11:59,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:12:00,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:12:00,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:12:00,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:12:00,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:12:00,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:12:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 09:12:04,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:12:05,519 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:12:05,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633499226] [2025-01-09 09:12:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633499226] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:12:05,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [921978424] [2025-01-09 09:12:05,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:12:05,520 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 09:12:05,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 09:12:05,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 09:12:05,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 09:12:05,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:12:07,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:12:07,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:12:07,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:12:07,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 09:12:07,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:12:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 09:12:10,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:12:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [921978424] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:12:11,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:12:11,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2025-01-09 09:12:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387203019] [2025-01-09 09:12:11,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:12:11,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:12:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:12:11,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:12:11,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:12:11,305 INFO L87 Difference]: Start difference. First operand 106 states and 160 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:12:17,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:12:21,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:12:22,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:12:27,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:12:30,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:12:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:12:31,048 INFO L93 Difference]: Finished difference Result 185 states and 274 transitions. [2025-01-09 09:12:31,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:12:31,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2025-01-09 09:12:31,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:12:31,094 INFO L225 Difference]: With dead ends: 185 [2025-01-09 09:12:31,094 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 09:12:31,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:12:31,095 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 94 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 66 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:12:31,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 295 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 18.9s Time] [2025-01-09 09:12:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 09:12:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2025-01-09 09:12:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 09:12:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2025-01-09 09:12:31,116 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 135 [2025-01-09 09:12:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:12:31,116 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2025-01-09 09:12:31,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:12:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2025-01-09 09:12:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 09:12:31,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:12:31,121 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:12:31,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-01-09 09:12:31,353 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 (5)] Ended with exit code 0 [2025-01-09 09:12:31,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /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-01-09 09:12:31,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:12:31,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:12:31,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1485543011, now seen corresponding path program 1 times [2025-01-09 09:12:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:12:31,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645022327] [2025-01-09 09:12:31,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:12:31,526 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-01-09 09:12:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:12:31,529 INFO L229 MonitoredProcess]: Starting monitored process 7 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-01-09 09:12:31,531 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 (7)] Waiting until timeout for monitored process [2025-01-09 09:12:31,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:12:32,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:12:32,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:12:32,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:12:32,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 09:12:32,508 INFO L279 TraceCheckSpWp]: Computing forward predicates...