./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.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_ps-cn-25_file-89.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 ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:00:23,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:00:23,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:00:23,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:00:23,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:00:23,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:00:23,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:00:23,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:00:23,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:00:23,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:00:23,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:00:23,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:00:23,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:00:23,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:00:23,739 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:00:23,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:00:23,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:00:23,739 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:00:23,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:00:23,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:00:23,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:00:23,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:00:23,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:00:23,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:00:23,741 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 -> ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e [2025-01-09 10:00:23,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:00:23,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:00:23,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:00:23,972 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:00:23,972 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:00:23,973 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_ps-cn-25_file-89.i [2025-01-09 10:00:25,096 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7a177130/fa25a7b1b90941de942135bce030372a/FLAG537614295 [2025-01-09 10:00:25,395 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:00:25,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-01-09 10:00:25,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7a177130/fa25a7b1b90941de942135bce030372a/FLAG537614295 [2025-01-09 10:00:25,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7a177130/fa25a7b1b90941de942135bce030372a [2025-01-09 10:00:25,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:00:25,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:00:25,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:00:25,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:00:25,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:00:25,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:25,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25, skipping insertion in model container [2025-01-09 10:00:25,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:25,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:00:25,801 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_ps-cn-25_file-89.i[915,928] [2025-01-09 10:00:25,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:00:25,880 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:00:25,891 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_ps-cn-25_file-89.i[915,928] [2025-01-09 10:00:25,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:00:25,931 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:00:25,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25 WrapperNode [2025-01-09 10:00:25,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:00:25,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:00:25,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:00:25,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:00:25,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:25,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:25,973 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2025-01-09 10:00:25,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:00:25,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:00:25,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:00:25,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:00:25,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:25,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:25,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:25,994 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 10:00:25,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:25,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:25,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:26,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:26,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:26,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:26,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:26,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:00:26,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:00:26,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:00:26,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:00:26,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (1/1) ... [2025-01-09 10:00:26,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:00:26,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:00:26,048 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 10:00:26,050 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 10:00:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:00:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:00:26,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:00:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:00:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:00:26,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:00:26,126 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:00:26,128 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:00:26,471 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 10:00:26,472 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:00:26,481 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:00:26,482 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:00:26,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:00:26 BoogieIcfgContainer [2025-01-09 10:00:26,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:00:26,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:00:26,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:00:26,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:00:26,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:00:25" (1/3) ... [2025-01-09 10:00:26,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a323a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:00:26, skipping insertion in model container [2025-01-09 10:00:26,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:25" (2/3) ... [2025-01-09 10:00:26,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a323a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:00:26, skipping insertion in model container [2025-01-09 10:00:26,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:00:26" (3/3) ... [2025-01-09 10:00:26,491 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-01-09 10:00:26,503 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:00:26,504 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:00:26,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:00:26,563 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;@38171ed4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:00:26,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:00:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 10:00:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 10:00:26,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:26,579 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:26,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:26,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash 407224748, now seen corresponding path program 1 times [2025-01-09 10:00:26,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:26,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060770631] [2025-01-09 10:00:26,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:26,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:26,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:00:26,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:00:26,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:26,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 10:00:26,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060770631] [2025-01-09 10:00:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060770631] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:00:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319617972] [2025-01-09 10:00:26,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:26,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:00:26,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:00:26,780 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 10:00:26,795 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 10:00:26,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:00:26,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:00:26,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:26,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:26,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:00:26,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:00:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 10:00:26,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:00:26,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319617972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:26,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:00:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:00:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773539078] [2025-01-09 10:00:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:26,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:00:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:26,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:00:26,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:00:26,948 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 10:00:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:26,971 INFO L93 Difference]: Finished difference Result 144 states and 255 transitions. [2025-01-09 10:00:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:00:26,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 143 [2025-01-09 10:00:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:26,977 INFO L225 Difference]: With dead ends: 144 [2025-01-09 10:00:26,978 INFO L226 Difference]: Without dead ends: 72 [2025-01-09 10:00:26,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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 10:00:26,983 INFO L435 NwaCegarLoop]: 114 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, 114 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 10:00:26,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:00:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-09 10:00:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-01-09 10:00:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 10:00:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 114 transitions. [2025-01-09 10:00:27,013 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 114 transitions. Word has length 143 [2025-01-09 10:00:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:27,013 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 114 transitions. [2025-01-09 10:00:27,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 10:00:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 114 transitions. [2025-01-09 10:00:27,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 10:00:27,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:27,020 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:27,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:00:27,221 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 10:00:27,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:27,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash 993681388, now seen corresponding path program 1 times [2025-01-09 10:00:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:27,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227614896] [2025-01-09 10:00:27,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:27,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:00:27,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:00:27,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:27,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:27,423 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 10:00:27,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:27,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227614896] [2025-01-09 10:00:27,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227614896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:27,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:27,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:00:27,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147980103] [2025-01-09 10:00:27,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:27,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:00:27,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:27,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:00:27,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:00:27,426 INFO L87 Difference]: Start difference. First operand 72 states and 114 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:00:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:27,475 INFO L93 Difference]: Finished difference Result 197 states and 313 transitions. [2025-01-09 10:00:27,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:00:27,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-01-09 10:00:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:27,481 INFO L225 Difference]: With dead ends: 197 [2025-01-09 10:00:27,481 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 10:00:27,482 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 10:00:27,483 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 86 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:27,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 253 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:00:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 10:00:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2025-01-09 10:00:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 10:00:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 198 transitions. [2025-01-09 10:00:27,503 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 198 transitions. Word has length 143 [2025-01-09 10:00:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:27,504 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 198 transitions. [2025-01-09 10:00:27,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:00:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 198 transitions. [2025-01-09 10:00:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 10:00:27,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:27,506 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:27,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:00:27,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:27,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:27,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1491709833, now seen corresponding path program 1 times [2025-01-09 10:00:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:27,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735717756] [2025-01-09 10:00:27,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:27,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:27,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 10:00:27,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 10:00:27,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:27,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 10:00:27,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735717756] [2025-01-09 10:00:27,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735717756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:27,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:27,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:00:27,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822752836] [2025-01-09 10:00:27,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:27,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:00:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:27,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:00:27,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:00:27,684 INFO L87 Difference]: Start difference. First operand 125 states and 198 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:00:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:27,746 INFO L93 Difference]: Finished difference Result 365 states and 580 transitions. [2025-01-09 10:00:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:00:27,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-01-09 10:00:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:27,752 INFO L225 Difference]: With dead ends: 365 [2025-01-09 10:00:27,753 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 10:00:27,754 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 10:00:27,756 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 104 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:27,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 210 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:00:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 10:00:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2025-01-09 10:00:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 156 states have (on average 1.3974358974358974) internal successors, (218), 158 states have internal predecessors, (218), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 10:00:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 370 transitions. [2025-01-09 10:00:27,799 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 370 transitions. Word has length 144 [2025-01-09 10:00:27,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:27,800 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 370 transitions. [2025-01-09 10:00:27,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:00:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 370 transitions. [2025-01-09 10:00:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 10:00:27,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:27,804 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:27,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:00:27,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:27,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:27,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1489862791, now seen corresponding path program 1 times [2025-01-09 10:00:27,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:27,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218504498] [2025-01-09 10:00:27,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:27,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 10:00:27,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 10:00:27,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:27,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 10:00:28,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218504498] [2025-01-09 10:00:28,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218504498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:28,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:28,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:00:28,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857918114] [2025-01-09 10:00:28,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:28,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:00:28,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:28,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:00:28,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:00:28,306 INFO L87 Difference]: Start difference. First operand 237 states and 370 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 10:00:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:28,539 INFO L93 Difference]: Finished difference Result 837 states and 1295 transitions. [2025-01-09 10:00:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:00:28,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2025-01-09 10:00:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:28,544 INFO L225 Difference]: With dead ends: 837 [2025-01-09 10:00:28,545 INFO L226 Difference]: Without dead ends: 603 [2025-01-09 10:00:28,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:00:28,546 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 360 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:28,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 246 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:00:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-01-09 10:00:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 419. [2025-01-09 10:00:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 286 states have (on average 1.4125874125874125) internal successors, (404), 292 states have internal predecessors, (404), 124 states have call successors, (124), 8 states have call predecessors, (124), 8 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 10:00:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 652 transitions. [2025-01-09 10:00:28,607 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 652 transitions. Word has length 144 [2025-01-09 10:00:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:28,608 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 652 transitions. [2025-01-09 10:00:28,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 10:00:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 652 transitions. [2025-01-09 10:00:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 10:00:28,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:28,613 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:28,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:00:28,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1525240827, now seen corresponding path program 1 times [2025-01-09 10:00:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213189678] [2025-01-09 10:00:28,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:28,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 10:00:28,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 10:00:28,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:28,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:00:28,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378407927] [2025-01-09 10:00:28,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:28,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:00:28,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:00:28,755 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 10:00:28,760 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 10:00:28,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 10:00:28,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 10:00:28,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:28,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:00:28,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 10:00:28,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 10:00:28,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 10:00:28,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:28,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:00:28,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 10:00:28,940 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 10:00:28,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 10:00:28,948 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 10:00:29,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:00:29,145 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 10:00:29,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 10:00:29,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:00:29 BoogieIcfgContainer [2025-01-09 10:00:29,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 10:00:29,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 10:00:29,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 10:00:29,223 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 10:00:29,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:00:26" (3/4) ... [2025-01-09 10:00:29,225 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 10:00:29,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 10:00:29,226 INFO L158 Benchmark]: Toolchain (without parser) took 3549.63ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.7MB in the beginning and 243.3MB in the end (delta: -137.6MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2025-01-09 10:00:29,226 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:00:29,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.22ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 90.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 10:00:29,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.56ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 87.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:00:29,227 INFO L158 Benchmark]: Boogie Preprocessor took 41.10ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 82.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 10:00:29,227 INFO L158 Benchmark]: RCFGBuilder took 467.28ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 59.2MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 10:00:29,227 INFO L158 Benchmark]: TraceAbstraction took 2737.73ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 58.2MB in the beginning and 243.4MB in the end (delta: -185.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:00:29,227 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 318.8MB. Free memory was 243.4MB in the beginning and 243.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:00:29,228 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.17ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.22ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 90.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.56ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 87.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.10ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 82.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 467.28ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 59.2MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2737.73ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 58.2MB in the beginning and 243.4MB in the end (delta: -185.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 318.8MB. Free memory was 243.4MB in the beginning and 243.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_8 = 32; [L25] signed long int var_1_9 = -16; [L26] unsigned short int var_1_10 = 5; [L27] unsigned char var_1_12 = 32; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 0; [L30] unsigned char var_1_15 = 0; [L31] double var_1_16 = 63.75; [L32] double var_1_17 = 8.5; [L33] signed short int var_1_18 = -64; [L34] unsigned char var_1_19 = 32; [L35] unsigned char var_1_20 = 8; [L36] signed char var_1_21 = 16; [L37] signed char var_1_22 = -64; [L38] signed char var_1_23 = -64; [L39] unsigned char var_1_24 = 0; [L40] signed short int var_1_25 = -5; [L41] unsigned char var_1_26 = 100; [L42] unsigned char var_1_27 = 1; [L43] unsigned char var_1_28 = 1; [L44] unsigned char var_1_29 = 1; [L45] signed long int last_1_var_1_1 = 32; [L46] unsigned char last_1_var_1_12 = 32; [L47] signed short int last_1_var_1_18 = -64; VAL [isInitial=0, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L176] isInitial = 1 [L177] FCALL initially() [L179] CALL updateLastVariables() [L167] last_1_var_1_1 = var_1_1 [L168] last_1_var_1_12 = var_1_12 [L169] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L179] RET updateLastVariables() [L180] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_8=32, var_1_9=-16] [L133] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_8=32, var_1_9=-16] [L134] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L134] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L135] var_1_9 = __VERIFIER_nondet_long() [L136] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L136] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L137] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L137] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L138] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L138] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L139] var_1_10 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L140] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L141] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L141] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L142] var_1_13 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L143] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L144] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L144] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L145] var_1_15 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L146] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L147] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L147] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L148] var_1_17 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L149] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L152] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L152] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L153] var_1_22 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_22 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L154] RET assume_abort_if_not(var_1_22 >= -126) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L155] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L155] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L156] var_1_24 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L157] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L158] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L158] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L159] var_1_28 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L160] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L161] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L161] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L162] var_1_29 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L163] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L164] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L164] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=66, var_1_21=16, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L180] RET updateVariables() [L181] CALL step() [L51] var_1_19 = var_1_20 [L52] var_1_21 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=-64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L53] COND TRUE var_1_22 <= var_1_21 [L54] var_1_23 = ((((var_1_22) < (64)) ? (var_1_22) : (64))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L64] COND TRUE ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) > var_1_21 [L65] var_1_25 = var_1_21 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L67] COND TRUE \read(var_1_24) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L68] COND FALSE !(var_1_20 <= var_1_23) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L72] COND FALSE !(! (var_1_24 && var_1_28)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L77] signed long int stepLocal_1 = last_1_var_1_18; [L78] signed long int stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_1=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L79] COND FALSE !(stepLocal_1 >= (last_1_var_1_18 / var_1_9)) [L86] var_1_8 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L88] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L89] COND FALSE !(var_1_10 < var_1_18) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L100] unsigned short int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_2=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L101] COND FALSE !(stepLocal_2 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L112] COND FALSE !(var_1_18 != var_1_12) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L117] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L124] COND FALSE !(\read(var_1_14)) [L127] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return ((((((var_1_18 != var_1_12) ? (var_1_14 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) < (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18))))) ? (((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) : (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18)))))))) : 1) : 1) && ((last_1_var_1_18 >= (last_1_var_1_18 / var_1_9)) ? ((last_1_var_1_18 < (last_1_var_1_1 * 256)) ? (var_1_8 == ((unsigned short int) ((((last_1_var_1_12) < (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12))))) ? (last_1_var_1_12) : (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12)))))))) : (var_1_8 == ((unsigned short int) last_1_var_1_12))) : (var_1_8 == ((unsigned short int) last_1_var_1_12)))) && ((var_1_10 < var_1_18) ? ((last_1_var_1_12 <= (5 - last_1_var_1_12)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((last_1_var_1_12 == var_1_8) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_8 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) ? ((! (var_1_8 >= var_1_12)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_14 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=66, var_1_1=32, var_1_20=66, var_1_21=65, var_1_22=65, var_1_23=64, var_1_24=1, var_1_25=65, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=68] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 550 mSDsluCounter, 823 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 348 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 475 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=419occurred in iteration=4, InterpolantAutomatonStates: 13, 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, 4 MinimizatonAttempts, 193 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1005 NumberOfCodeBlocks, 1005 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 794 SizeOfPredicates, 0 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 4578/4620 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 10:00:29,244 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_ps-cn-25_file-89.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 ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:00:31,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:00:31,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 10:00:31,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:00:31,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:00:31,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:00:31,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:00:31,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:00:31,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:00:31,359 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:00:31,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:00:31,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:00:31,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:00:31,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:00:31,359 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:00:31,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:00:31,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:00:31,360 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:00:31,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:00:31,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:00:31,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:00:31,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:00:31,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:00:31,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 10:00:31,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 10:00:31,361 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 10:00:31,361 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:00:31,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:00:31,361 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:00:31,361 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:00:31,361 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:00:31,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:00:31,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:00:31,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:00:31,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:00:31,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:00:31,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:00:31,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:00:31,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:00:31,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:00:31,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:00:31,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:00:31,363 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:00:31,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:00:31,363 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 10:00:31,363 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 10:00:31,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:00:31,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:00:31,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:00:31,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:00:31,364 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 -> ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e [2025-01-09 10:00:31,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:00:31,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:00:31,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:00:31,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:00:31,663 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:00:31,664 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_ps-cn-25_file-89.i [2025-01-09 10:00:32,890 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3350aa621/fae96fd11efe4126b8e2aa8e956d989e/FLAG3e020044b [2025-01-09 10:00:33,077 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:00:33,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-01-09 10:00:33,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3350aa621/fae96fd11efe4126b8e2aa8e956d989e/FLAG3e020044b [2025-01-09 10:00:33,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3350aa621/fae96fd11efe4126b8e2aa8e956d989e [2025-01-09 10:00:33,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:00:33,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:00:33,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:00:33,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:00:33,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:00:33,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42415322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33, skipping insertion in model container [2025-01-09 10:00:33,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:00:33,229 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_ps-cn-25_file-89.i[915,928] [2025-01-09 10:00:33,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:00:33,300 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:00:33,310 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_ps-cn-25_file-89.i[915,928] [2025-01-09 10:00:33,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:00:33,359 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:00:33,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33 WrapperNode [2025-01-09 10:00:33,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:00:33,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:00:33,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:00:33,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:00:33,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,398 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-01-09 10:00:33,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:00:33,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:00:33,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:00:33,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:00:33,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,426 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 10:00:33,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:00:33,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:00:33,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:00:33,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:00:33,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (1/1) ... [2025-01-09 10:00:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:00:33,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:00:33,476 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 10:00:33,487 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 10:00:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:00:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 10:00:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:00:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:00:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:00:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:00:33,591 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:00:33,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:00:34,023 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 10:00:34,023 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:00:34,031 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:00:34,031 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:00:34,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:00:34 BoogieIcfgContainer [2025-01-09 10:00:34,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:00:34,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:00:34,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:00:34,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:00:34,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:00:33" (1/3) ... [2025-01-09 10:00:34,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744cd0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:00:34, skipping insertion in model container [2025-01-09 10:00:34,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:33" (2/3) ... [2025-01-09 10:00:34,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744cd0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:00:34, skipping insertion in model container [2025-01-09 10:00:34,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:00:34" (3/3) ... [2025-01-09 10:00:34,040 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-01-09 10:00:34,051 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:00:34,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:00:34,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:00:34,100 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;@1522c07f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:00:34,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:00:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 10:00:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 10:00:34,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:34,111 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:34,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:34,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash 407224748, now seen corresponding path program 1 times [2025-01-09 10:00:34,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:00:34,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326884718] [2025-01-09 10:00:34,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:34,124 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 10:00:34,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:00:34,129 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 10:00:34,130 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 10:00:34,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:00:34,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:00:34,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:34,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:34,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:00:34,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:00:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 10:00:34,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:00:34,409 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:00:34,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326884718] [2025-01-09 10:00:34,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326884718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:34,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:34,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:00:34,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76064372] [2025-01-09 10:00:34,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:34,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:00:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:00:34,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:00:34,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:00:34,437 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 10:00:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:34,453 INFO L93 Difference]: Finished difference Result 144 states and 255 transitions. [2025-01-09 10:00:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:00:34,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 143 [2025-01-09 10:00:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:34,462 INFO L225 Difference]: With dead ends: 144 [2025-01-09 10:00:34,462 INFO L226 Difference]: Without dead ends: 72 [2025-01-09 10:00:34,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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 10:00:34,466 INFO L435 NwaCegarLoop]: 114 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, 114 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 10:00:34,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:00:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-09 10:00:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-01-09 10:00:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 10:00:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 114 transitions. [2025-01-09 10:00:34,495 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 114 transitions. Word has length 143 [2025-01-09 10:00:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:34,496 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 114 transitions. [2025-01-09 10:00:34,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 10:00:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 114 transitions. [2025-01-09 10:00:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 10:00:34,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:34,501 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:34,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:00:34,701 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 10:00:34,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:34,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash 993681388, now seen corresponding path program 1 times [2025-01-09 10:00:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:00:34,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771590353] [2025-01-09 10:00:34,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:34,705 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 10:00:34,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:00:34,714 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 10:00:34,716 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 10:00:34,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:00:34,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:00:34,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:34,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:34,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 10:00:34,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:00:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 10:00:34,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:00:34,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:00:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771590353] [2025-01-09 10:00:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771590353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:34,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:34,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:00:34,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460207484] [2025-01-09 10:00:34,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:34,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:00:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:00:34,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:00:34,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:00:34,935 INFO L87 Difference]: Start difference. First operand 72 states and 114 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:00:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:34,982 INFO L93 Difference]: Finished difference Result 197 states and 313 transitions. [2025-01-09 10:00:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:00:34,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-01-09 10:00:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:34,985 INFO L225 Difference]: With dead ends: 197 [2025-01-09 10:00:34,988 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 10:00:34,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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 10:00:34,989 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 86 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:34,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 252 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:00:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 10:00:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2025-01-09 10:00:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 10:00:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 198 transitions. [2025-01-09 10:00:35,013 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 198 transitions. Word has length 143 [2025-01-09 10:00:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:35,015 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 198 transitions. [2025-01-09 10:00:35,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:00:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 198 transitions. [2025-01-09 10:00:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 10:00:35,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:35,019 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:35,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 10:00:35,220 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 10:00:35,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:35,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1491709833, now seen corresponding path program 1 times [2025-01-09 10:00:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:00:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865726893] [2025-01-09 10:00:35,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:35,225 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 10:00:35,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:00:35,233 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 10:00:35,235 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 10:00:35,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 10:00:35,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 10:00:35,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:35,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:35,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 10:00:35,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:00:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 10:00:35,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:00:35,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:00:35,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865726893] [2025-01-09 10:00:35,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865726893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:35,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:35,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:00:35,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694310048] [2025-01-09 10:00:35,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:35,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:00:35,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:00:35,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:00:35,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:00:35,744 INFO L87 Difference]: Start difference. First operand 125 states and 198 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:00:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:35,870 INFO L93 Difference]: Finished difference Result 365 states and 580 transitions. [2025-01-09 10:00:35,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:00:35,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-01-09 10:00:35,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:35,875 INFO L225 Difference]: With dead ends: 365 [2025-01-09 10:00:35,877 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 10:00:35,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 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 10:00:35,879 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 30 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:35,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 210 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:00:35,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 10:00:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2025-01-09 10:00:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 156 states have (on average 1.3974358974358974) internal successors, (218), 158 states have internal predecessors, (218), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 10:00:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 370 transitions. [2025-01-09 10:00:35,926 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 370 transitions. Word has length 144 [2025-01-09 10:00:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:35,927 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 370 transitions. [2025-01-09 10:00:35,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:00:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 370 transitions. [2025-01-09 10:00:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 10:00:35,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:35,932 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:35,940 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 (4)] Forceful destruction successful, exit code 0 [2025-01-09 10:00:36,133 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 10:00:36,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:36,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1489862791, now seen corresponding path program 1 times [2025-01-09 10:00:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:00:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537794368] [2025-01-09 10:00:36,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:36,136 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 10:00:36,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:00:36,138 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 10:00:36,140 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 10:00:36,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 10:00:36,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 10:00:36,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:36,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:36,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 10:00:36,332 INFO L279 TraceCheckSpWp]: Computing forward predicates...