./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.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-32.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 c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:05:23,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:05:23,940 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:05:23,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:05:23,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:05:23,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:05:23,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:05:23,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:05:23,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:05:23,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:05:23,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:05:23,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:05:23,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:05:23,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:05:23,970 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:05:23,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:05:23,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:05:23,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:05:23,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:05:23,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:05:23,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:05:23,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:05:23,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:05:23,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:05:23,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:05:23,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:05:23,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:05:23,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:05:23,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:05:23,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:05:23,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:05:23,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:05:23,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:05:23,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:05:23,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:05:23,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:05:23,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:05:23,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:05:23,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:05:23,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:05:23,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:05:23,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:05:23,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:05:23,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:05:23,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:05:23,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:05:23,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:05:23,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:05:23,973 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 -> c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb [2025-01-09 09:05:24,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:05:24,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:05:24,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:05:24,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:05:24,217 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:05:24,218 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-32.i [2025-01-09 09:05:25,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3fe83927/8db1a81ba55840d5a101ce194afaed05/FLAG9da261cc2 [2025-01-09 09:05:25,579 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:05:25,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i [2025-01-09 09:05:25,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3fe83927/8db1a81ba55840d5a101ce194afaed05/FLAG9da261cc2 [2025-01-09 09:05:25,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3fe83927/8db1a81ba55840d5a101ce194afaed05 [2025-01-09 09:05:25,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:05:25,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:05:25,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:05:25,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:05:25,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:05:25,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:05:25" (1/1) ... [2025-01-09 09:05:25,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ff4fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:25, skipping insertion in model container [2025-01-09 09:05:25,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:05:25" (1/1) ... [2025-01-09 09:05:25,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:05:26,011 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-32.i[913,926] [2025-01-09 09:05:26,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:05:26,056 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:05:26,067 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-32.i[913,926] [2025-01-09 09:05:26,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:05:26,111 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:05:26,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26 WrapperNode [2025-01-09 09:05:26,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:05:26,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:05:26,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:05:26,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:05:26,122 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:05:26" (1/1) ... [2025-01-09 09:05:26,127 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:05:26" (1/1) ... [2025-01-09 09:05:26,145 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-01-09 09:05:26,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:05:26,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:05:26,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:05:26,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:05:26,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,169 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:05:26,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:05:26,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:05:26,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:05:26,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:05:26,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (1/1) ... [2025-01-09 09:05:26,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:05:26,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:05:26,206 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:05:26,210 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:05:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:05:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:05:26,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:05:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:05:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:05:26,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:05:26,281 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:05:26,282 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:05:26,506 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 09:05:26,507 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:05:26,517 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:05:26,517 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:05:26,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:26 BoogieIcfgContainer [2025-01-09 09:05:26,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:05:26,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:05:26,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:05:26,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:05:26,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:05:25" (1/3) ... [2025-01-09 09:05:26,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f787313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:05:26, skipping insertion in model container [2025-01-09 09:05:26,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:26" (2/3) ... [2025-01-09 09:05:26,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f787313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:05:26, skipping insertion in model container [2025-01-09 09:05:26,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:26" (3/3) ... [2025-01-09 09:05:26,526 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-32.i [2025-01-09 09:05:26,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:05:26,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-32.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:05:26,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:05:26,597 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;@66496f3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:05:26,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:05:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 09:05:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 09:05:26,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:05:26,607 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:26,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:05:26,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:05:26,612 INFO L85 PathProgramCache]: Analyzing trace with hash -302288903, now seen corresponding path program 1 times [2025-01-09 09:05:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:05:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914095557] [2025-01-09 09:05:26,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:05:26,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:05:26,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 09:05:26,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 09:05:26,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:26,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:05:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 09:05:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:05:26,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914095557] [2025-01-09 09:05:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914095557] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:05:26,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910612504] [2025-01-09 09:05:26,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:05:26,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:05:26,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:05:26,841 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:05:26,843 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:05:26,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 09:05:26,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 09:05:26,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:26,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:05:26,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:05:26,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:05:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 09:05:27,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:05:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910612504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:05:27,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:05:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:05:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969709111] [2025-01-09 09:05:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:05:27,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:05:27,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:05:27,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:05:27,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:05:27,033 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 09:05:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:05:27,053 INFO L93 Difference]: Finished difference Result 116 states and 198 transitions. [2025-01-09 09:05:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:05:27,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2025-01-09 09:05:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:05:27,058 INFO L225 Difference]: With dead ends: 116 [2025-01-09 09:05:27,058 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 09:05:27,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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:05:27,062 INFO L435 NwaCegarLoop]: 87 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, 87 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:05:27,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:05:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 09:05:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-09 09:05:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 09:05:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2025-01-09 09:05:27,094 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 123 [2025-01-09 09:05:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:05:27,095 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2025-01-09 09:05:27,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 09:05:27,095 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2025-01-09 09:05:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 09:05:27,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:05:27,098 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:27,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:05:27,298 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:05:27,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:05:27,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:05:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash -124859137, now seen corresponding path program 1 times [2025-01-09 09:05:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:05:27,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720969132] [2025-01-09 09:05:27,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:05:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:05:27,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 09:05:27,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 09:05:27,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:27,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:05:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 09:05:27,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:05:27,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720969132] [2025-01-09 09:05:27,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720969132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:05:27,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:05:27,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:05:27,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832677868] [2025-01-09 09:05:27,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:05:27,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:05:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:05:27,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:05:27,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:05:27,528 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 09:05:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:05:27,567 INFO L93 Difference]: Finished difference Result 168 states and 255 transitions. [2025-01-09 09:05:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:05:27,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2025-01-09 09:05:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:05:27,570 INFO L225 Difference]: With dead ends: 168 [2025-01-09 09:05:27,570 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 09:05:27,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:05:27,571 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:05:27,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 160 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:05:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 09:05:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-01-09 09:05:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 09:05:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 167 transitions. [2025-01-09 09:05:27,585 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 167 transitions. Word has length 123 [2025-01-09 09:05:27,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:05:27,588 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 167 transitions. [2025-01-09 09:05:27,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 09:05:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 167 transitions. [2025-01-09 09:05:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 09:05:27,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:05:27,591 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:27,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:05:27,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:05:27,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:05:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1650148225, now seen corresponding path program 1 times [2025-01-09 09:05:27,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:05:27,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639671433] [2025-01-09 09:05:27,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:05:27,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:05:27,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 09:05:27,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 09:05:27,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:27,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:05:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 09:05:27,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:05:27,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639671433] [2025-01-09 09:05:27,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639671433] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:05:27,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388798037] [2025-01-09 09:05:27,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:05:27,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:05:27,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:05:27,860 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:05:27,861 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:05:27,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 09:05:27,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 09:05:27,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:27,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:05:27,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:05:27,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:05:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-01-09 09:05:28,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:05:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 09:05:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388798037] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:05:28,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:05:28,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 09:05:28,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282932731] [2025-01-09 09:05:28,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:05:28,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:05:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:05:28,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:05:28,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:05:28,191 INFO L87 Difference]: Start difference. First operand 110 states and 167 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 09:05:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:05:28,438 INFO L93 Difference]: Finished difference Result 255 states and 381 transitions. [2025-01-09 09:05:28,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:05:28,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 123 [2025-01-09 09:05:28,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:05:28,444 INFO L225 Difference]: With dead ends: 255 [2025-01-09 09:05:28,444 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 09:05:28,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:05:28,445 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 88 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:05:28,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 191 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:05:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 09:05:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2025-01-09 09:05:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 85 states have internal predecessors, (104), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 09:05:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2025-01-09 09:05:28,475 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 123 [2025-01-09 09:05:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:05:28,477 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2025-01-09 09:05:28,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 09:05:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2025-01-09 09:05:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 09:05:28,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:05:28,480 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:28,488 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:05:28,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:05:28,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:05:28,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:05:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash -458631290, now seen corresponding path program 1 times [2025-01-09 09:05:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:05:28,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412106713] [2025-01-09 09:05:28,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:05:28,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:05:28,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 09:05:28,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 09:05:28,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:28,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:05:28,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:05:28,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 09:05:28,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 09:05:28,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:28,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:05:28,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:05:28,837 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:05:28,837 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:05:28,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:05:28,841 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 09:05:28,893 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:05:28,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:05:28 BoogieIcfgContainer [2025-01-09 09:05:28,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:05:28,896 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:05:28,896 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:05:28,896 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:05:28,897 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:26" (3/4) ... [2025-01-09 09:05:28,898 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:05:28,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:05:28,899 INFO L158 Benchmark]: Toolchain (without parser) took 2982.61ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 68.4MB in the end (delta: 38.5MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2025-01-09 09:05:28,899 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:05:28,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.05ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 93.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:05:28,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.09ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 90.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:05:28,900 INFO L158 Benchmark]: Boogie Preprocessor took 35.67ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 85.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:05:28,900 INFO L158 Benchmark]: RCFGBuilder took 335.54ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 66.3MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:05:28,900 INFO L158 Benchmark]: TraceAbstraction took 2377.01ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 69.6MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:05:28,901 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 68.4MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:05:28,902 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.05ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 93.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.09ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 90.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.67ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 85.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 335.54ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 66.3MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2377.01ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 69.6MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 68.4MB in the end (delta: 1.2MB). 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 111, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticFLOAToperation at line 63, overapproximation of someBinaryArithmeticFLOAToperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] unsigned char last_1_var_1_1 = 2; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L134] isInitial = 1 [L135] FCALL initially() [L137] CALL updateLastVariables() [L125] last_1_var_1_1 = var_1_1 [L126] last_1_var_1_15 = var_1_15 [L127] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L137] RET updateLastVariables() [L138] CALL updateVariables() [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L94] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] var_1_6 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] var_1_7 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L103] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L104] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L104] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L105] var_1_8 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L107] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L107] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L108] var_1_11 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L109] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L110] var_1_12 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L111] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L112] var_1_16 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L114] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L115] var_1_17 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L116] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L118] var_1_19 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L119] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L120] var_1_21 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L121] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L122] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L122] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L138] RET updateVariables() [L139] CALL step() [L48] COND FALSE !(var_1_5 >= var_1_6) [L57] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L59] unsigned char stepLocal_1 = var_1_15; [L60] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L61] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L62] COND TRUE var_1_15 && stepLocal_1 [L63] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L68] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L77] COND TRUE var_1_11 == var_1_18 [L78] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L80] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L83] COND TRUE (var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5 [L84] var_1_9 = ((4.5f + var_1_11) - var_1_12) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L88] var_1_22 = var_1_12 [L89] var_1_23 = var_1_8 [L90] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L139] RET step() [L140] CALL, EXPR property() [L130-L131] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 438 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 258 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 732 ConstructedInterpolants, 0 QuantifiedInterpolants, 1122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4032/4104 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:05:28,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.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 c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:05:30,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:05:30,977 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:05:30,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:05:30,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:05:30,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:05:31,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:05:31,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:05:31,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:05:31,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:05:31,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:05:31,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:05:31,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:05:31,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:05:31,001 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:05:31,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:05:31,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:05:31,001 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:05:31,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:05:31,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:05:31,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:05:31,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:05:31,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:05:31,002 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:05:31,002 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:05:31,002 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:05:31,002 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:05:31,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:05:31,002 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:05:31,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:05:31,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:05:31,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:05:31,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:05:31,004 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:05:31,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:05:31,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:05:31,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:05:31,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:05:31,005 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 -> c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb [2025-01-09 09:05:31,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:05:31,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:05:31,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:05:31,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:05:31,318 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:05:31,319 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-32.i [2025-01-09 09:05:32,464 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52756f0dc/72fd4195c95b43bb96703993a8b74545/FLAGfa228f3d2 [2025-01-09 09:05:32,702 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:05:32,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i [2025-01-09 09:05:32,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52756f0dc/72fd4195c95b43bb96703993a8b74545/FLAGfa228f3d2 [2025-01-09 09:05:33,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52756f0dc/72fd4195c95b43bb96703993a8b74545 [2025-01-09 09:05:33,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:05:33,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:05:33,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:05:33,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:05:33,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:05:33,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c34afe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33, skipping insertion in model container [2025-01-09 09:05:33,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:05:33,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i[913,926] [2025-01-09 09:05:33,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:05:33,254 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:05:33,261 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-32.i[913,926] [2025-01-09 09:05:33,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:05:33,292 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:05:33,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33 WrapperNode [2025-01-09 09:05:33,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:05:33,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:05:33,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:05:33,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:05:33,298 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:05:33" (1/1) ... [2025-01-09 09:05:33,305 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:05:33" (1/1) ... [2025-01-09 09:05:33,332 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-01-09 09:05:33,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:05:33,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:05:33,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:05:33,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:05:33,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,366 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:05:33,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:05:33,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:05:33,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:05:33,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:05:33,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (1/1) ... [2025-01-09 09:05:33,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:05:33,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:05:33,414 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:05:33,418 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:05:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:05:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:05:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:05:33,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:05:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:05:33,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:05:33,488 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:05:33,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:05:36,935 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 09:05:36,936 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:05:36,943 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:05:36,943 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:05:36,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:36 BoogieIcfgContainer [2025-01-09 09:05:36,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:05:36,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:05:36,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:05:36,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:05:36,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:05:33" (1/3) ... [2025-01-09 09:05:36,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8ee707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:05:36, skipping insertion in model container [2025-01-09 09:05:36,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:33" (2/3) ... [2025-01-09 09:05:36,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8ee707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:05:36, skipping insertion in model container [2025-01-09 09:05:36,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:36" (3/3) ... [2025-01-09 09:05:36,949 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-32.i [2025-01-09 09:05:36,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:05:36,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-32.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:05:36,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:05:36,995 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;@5cde8a4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:05:36,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:05:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 09:05:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 09:05:37,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:05:37,004 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:37,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:05:37,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:05:37,007 INFO L85 PathProgramCache]: Analyzing trace with hash -302288903, now seen corresponding path program 1 times [2025-01-09 09:05:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:05:37,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342955724] [2025-01-09 09:05:37,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:05:37,017 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:05:37,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:05:37,024 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:05:37,025 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:05:37,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 09:05:37,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 09:05:37,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:37,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:05:37,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:05:37,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:05:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-01-09 09:05:37,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:05:37,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:05:37,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342955724] [2025-01-09 09:05:37,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342955724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:05:37,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:05:37,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:05:37,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003265887] [2025-01-09 09:05:37,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:05:37,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:05:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:05:37,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:05:37,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:05:37,366 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 09:05:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:05:37,380 INFO L93 Difference]: Finished difference Result 116 states and 198 transitions. [2025-01-09 09:05:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:05:37,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2025-01-09 09:05:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:05:37,385 INFO L225 Difference]: With dead ends: 116 [2025-01-09 09:05:37,386 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 09:05:37,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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:05:37,389 INFO L435 NwaCegarLoop]: 87 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, 87 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:05:37,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:05:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 09:05:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-09 09:05:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 09:05:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2025-01-09 09:05:37,413 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 123 [2025-01-09 09:05:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:05:37,414 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2025-01-09 09:05:37,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 09:05:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2025-01-09 09:05:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 09:05:37,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:05:37,417 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:37,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 09:05:37,617 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:05:37,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:05:37,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:05:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash -124859137, now seen corresponding path program 1 times [2025-01-09 09:05:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:05:37,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796657396] [2025-01-09 09:05:37,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:05:37,620 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:05:37,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:05:37,622 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:05:37,626 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:05:37,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 09:05:37,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 09:05:37,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:37,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:05:37,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 09:05:37,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:05:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 09:05:38,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:05:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 09:05:38,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:05:38,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796657396] [2025-01-09 09:05:38,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796657396] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:05:38,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:05:38,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2025-01-09 09:05:38,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772923020] [2025-01-09 09:05:38,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:05:38,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:05:38,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:05:38,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:05:38,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:05:38,344 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 09:05:40,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:05:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:05:41,059 INFO L93 Difference]: Finished difference Result 279 states and 403 transitions. [2025-01-09 09:05:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 09:05:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 123 [2025-01-09 09:05:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:05:41,066 INFO L225 Difference]: With dead ends: 279 [2025-01-09 09:05:41,066 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 09:05:41,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 09:05:41,068 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 322 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:05:41,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 459 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 09:05:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 09:05:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2025-01-09 09:05:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 131 states have internal predecessors, (161), 71 states have call successors, (71), 9 states have call predecessors, (71), 9 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 09:05:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 303 transitions. [2025-01-09 09:05:41,104 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 303 transitions. Word has length 123 [2025-01-09 09:05:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:05:41,104 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 303 transitions. [2025-01-09 09:05:41,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 09:05:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 303 transitions. [2025-01-09 09:05:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 09:05:41,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:05:41,106 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:41,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:05:41,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:05:41,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:05:41,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:05:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2061328644, now seen corresponding path program 1 times [2025-01-09 09:05:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:05:41,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841656196] [2025-01-09 09:05:41,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:05:41,309 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:05:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:05:41,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:05:41,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 09:05:41,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 09:05:41,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 09:05:41,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:41,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:05:41,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:05:41,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:05:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 09:05:41,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:05:41,807 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:05:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841656196] [2025-01-09 09:05:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841656196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:05:41,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:05:41,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:05:41,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458836117] [2025-01-09 09:05:41,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:05:41,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:05:41,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:05:41,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:05:41,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:05:41,809 INFO L87 Difference]: Start difference. First operand 211 states and 303 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 09:05:43,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:05:45,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:05:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:05:45,570 INFO L93 Difference]: Finished difference Result 581 states and 829 transitions. [2025-01-09 09:05:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:05:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2025-01-09 09:05:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:05:45,597 INFO L225 Difference]: With dead ends: 581 [2025-01-09 09:05:45,597 INFO L226 Difference]: Without dead ends: 396 [2025-01-09 09:05:45,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:05:45,599 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:05:45,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 158 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-09 09:05:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-09 09:05:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 330. [2025-01-09 09:05:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 206 states have internal predecessors, (253), 109 states have call successors, (109), 15 states have call predecessors, (109), 15 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 09:05:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 471 transitions. [2025-01-09 09:05:45,664 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 471 transitions. Word has length 124 [2025-01-09 09:05:45,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:05:45,666 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 471 transitions. [2025-01-09 09:05:45,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 09:05:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2025-01-09 09:05:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 09:05:45,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:05:45,667 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:45,677 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 (4)] Ended with exit code 0 [2025-01-09 09:05:45,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:05:45,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:05:45,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:05:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash -458631290, now seen corresponding path program 1 times [2025-01-09 09:05:45,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:05:45,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006674042] [2025-01-09 09:05:45,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:05:45,871 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:05:45,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:05:45,873 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:05:45,874 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:05:45,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 09:05:46,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 09:05:46,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:05:46,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:05:46,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 09:05:46,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:05:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-09 09:05:58,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:06:20,649 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:06:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006674042] [2025-01-09 09:06:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006674042] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:06:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [882629419] [2025-01-09 09:06:20,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:06:20,649 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 09:06:20,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 09:06:20,654 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:06:20,656 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:06:20,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 09:06:21,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 09:06:21,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:06:21,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:06:21,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 09:06:21,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:06:53,396 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 09:06:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-09 09:06:53,774 INFO L312 TraceCheckSpWp]: Computing backward predicates...