./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.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_fillercodestructure_filler-pr-ci_file-96.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 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:11:29,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:11:29,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:11:29,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:11:29,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:11:29,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:11:29,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:11:29,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:11:29,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:11:29,824 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:11:29,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:11:29,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:11:29,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:11:29,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:11:29,825 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:11:29,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:11:29,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:11:29,826 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:11:29,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:11:29,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:11:29,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:11:29,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:11:29,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:11:29,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:11:29,826 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:11:29,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:11:29,827 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:11:29,827 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:11:29,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:11:29,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:11:29,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:11:29,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:11:29,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:11:29,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:11:29,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:11:29,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:11:29,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:11:29,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:11:29,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:11:29,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:11:29,828 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:11:29,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:11:29,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:11:29,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:11:29,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:11:29,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:11:29,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:11:29,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:11:29,829 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 -> 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 [2025-01-09 11:11:30,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:11:30,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:11:30,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:11:30,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:11:30,046 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:11:30,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-01-09 11:11:31,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/313cfc1f7/12825a491ccd48b18f61712a4a9c5d0d/FLAG784109205 [2025-01-09 11:11:31,458 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:11:31,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-01-09 11:11:31,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/313cfc1f7/12825a491ccd48b18f61712a4a9c5d0d/FLAG784109205 [2025-01-09 11:11:31,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/313cfc1f7/12825a491ccd48b18f61712a4a9c5d0d [2025-01-09 11:11:31,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:11:31,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:11:31,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:11:31,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:11:31,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:11:31,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24416f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31, skipping insertion in model container [2025-01-09 11:11:31,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:11:31,573 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_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2025-01-09 11:11:31,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:11:31,619 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:11:31,626 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_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2025-01-09 11:11:31,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:11:31,657 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:11:31,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31 WrapperNode [2025-01-09 11:11:31,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:11:31,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:11:31,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:11:31,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:11:31,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,695 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2025-01-09 11:11:31,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:11:31,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:11:31,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:11:31,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:11:31,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,721 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 11:11:31,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:11:31,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:11:31,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:11:31,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:11:31,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (1/1) ... [2025-01-09 11:11:31,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:11:31,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:31,771 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 11:11:31,775 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 11:11:31,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:11:31,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:11:31,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:11:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:11:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:11:31,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:11:31,872 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:11:31,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:11:32,124 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 11:11:32,124 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:11:32,131 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:11:32,131 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:11:32,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:11:32 BoogieIcfgContainer [2025-01-09 11:11:32,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:11:32,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:11:32,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:11:32,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:11:32,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:11:31" (1/3) ... [2025-01-09 11:11:32,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85db7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:11:32, skipping insertion in model container [2025-01-09 11:11:32,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:31" (2/3) ... [2025-01-09 11:11:32,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85db7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:11:32, skipping insertion in model container [2025-01-09 11:11:32,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:11:32" (3/3) ... [2025-01-09 11:11:32,138 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-01-09 11:11:32,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:11:32,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:11:32,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:11:32,192 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;@3d0dab93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:11:32,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:11:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:11:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 11:11:32,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:32,208 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:32,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:32,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:32,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1562632326, now seen corresponding path program 1 times [2025-01-09 11:11:32,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066423432] [2025-01-09 11:11:32,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:32,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 11:11:32,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 11:11:32,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:32,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 11:11:32,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:32,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066423432] [2025-01-09 11:11:32,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066423432] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:11:32,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781582374] [2025-01-09 11:11:32,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:32,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:32,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:32,460 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 11:11:32,461 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 11:11:32,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 11:11:32,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 11:11:32,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:32,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:32,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:11:32,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 11:11:32,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:11:32,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781582374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:32,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:11:32,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:11:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299684089] [2025-01-09 11:11:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:32,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:11:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:32,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:11:32,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:11:32,702 INFO L87 Difference]: Start difference. First operand has 94 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:11:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:32,727 INFO L93 Difference]: Finished difference Result 179 states and 316 transitions. [2025-01-09 11:11:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:11:32,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2025-01-09 11:11:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:32,733 INFO L225 Difference]: With dead ends: 179 [2025-01-09 11:11:32,733 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 11:11:32,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 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 11:11:32,737 INFO L435 NwaCegarLoop]: 136 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, 136 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 11:11:32,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:11:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 11:11:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 11:11:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:11:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2025-01-09 11:11:32,766 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 196 [2025-01-09 11:11:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:32,766 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2025-01-09 11:11:32,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:11:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2025-01-09 11:11:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 11:11:32,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:32,769 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:32,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 11:11:32,974 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 11:11:32,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:32,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1522318092, now seen corresponding path program 1 times [2025-01-09 11:11:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:32,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064698445] [2025-01-09 11:11:32,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:32,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 11:11:33,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 11:11:33,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:33,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:11:33,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:33,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064698445] [2025-01-09 11:11:33,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064698445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:33,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:11:33,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:11:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959670346] [2025-01-09 11:11:33,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:33,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:11:33,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:33,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:11:33,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:11:33,296 INFO L87 Difference]: Start difference. First operand 88 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:11:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:33,501 INFO L93 Difference]: Finished difference Result 224 states and 347 transitions. [2025-01-09 11:11:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:11:33,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-01-09 11:11:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:33,505 INFO L225 Difference]: With dead ends: 224 [2025-01-09 11:11:33,507 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 11:11:33,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:11:33,509 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 69 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:33,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 402 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:11:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 11:11:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-01-09 11:11:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 85 states have internal predecessors, (110), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 11:11:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 208 transitions. [2025-01-09 11:11:33,535 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 208 transitions. Word has length 196 [2025-01-09 11:11:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:33,536 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 208 transitions. [2025-01-09 11:11:33,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:11:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 208 transitions. [2025-01-09 11:11:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 11:11:33,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:33,538 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:33,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:11:33,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:33,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1129291082, now seen corresponding path program 1 times [2025-01-09 11:11:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:33,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088037114] [2025-01-09 11:11:33,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:33,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 11:11:33,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 11:11:33,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:33,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:11:33,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088037114] [2025-01-09 11:11:33,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088037114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:33,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:11:33,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:11:33,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338829246] [2025-01-09 11:11:33,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:33,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:11:33,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:33,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:11:33,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:11:33,832 INFO L87 Difference]: Start difference. First operand 136 states and 208 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:11:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:33,959 INFO L93 Difference]: Finished difference Result 404 states and 622 transitions. [2025-01-09 11:11:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:11:33,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-01-09 11:11:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:33,966 INFO L225 Difference]: With dead ends: 404 [2025-01-09 11:11:33,967 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 11:11:33,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:11:33,968 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 156 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:33,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 441 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:11:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 11:11:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 209. [2025-01-09 11:11:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 125 states have (on average 1.304) internal successors, (163), 126 states have internal predecessors, (163), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 11:11:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 323 transitions. [2025-01-09 11:11:34,012 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 323 transitions. Word has length 196 [2025-01-09 11:11:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:34,012 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 323 transitions. [2025-01-09 11:11:34,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:11:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 323 transitions. [2025-01-09 11:11:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 11:11:34,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:34,014 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:34,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:11:34,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:34,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:34,015 INFO L85 PathProgramCache]: Analyzing trace with hash -864853624, now seen corresponding path program 1 times [2025-01-09 11:11:34,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:34,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103275119] [2025-01-09 11:11:34,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:34,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:34,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 11:11:34,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 11:11:34,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:34,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:11:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103275119] [2025-01-09 11:11:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103275119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:11:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108894089] [2025-01-09 11:11:34,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:34,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:34,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:34,334 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 11:11:34,335 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 11:11:34,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 11:11:34,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 11:11:34,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:34,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:34,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 11:11:34,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 978 proven. 66 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2025-01-09 11:11:34,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:11:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:11:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108894089] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:11:35,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:11:35,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 11:11:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366201064] [2025-01-09 11:11:35,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:11:35,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:11:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:35,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:11:35,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:11:35,347 INFO L87 Difference]: Start difference. First operand 209 states and 323 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 6 states have call successors, (75), 3 states have call predecessors, (75), 5 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2025-01-09 11:11:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:35,877 INFO L93 Difference]: Finished difference Result 512 states and 734 transitions. [2025-01-09 11:11:35,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 11:11:35,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 6 states have call successors, (75), 3 states have call predecessors, (75), 5 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) Word has length 196 [2025-01-09 11:11:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:35,880 INFO L225 Difference]: With dead ends: 512 [2025-01-09 11:11:35,880 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 11:11:35,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 11:11:35,882 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 364 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:35,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 328 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:11:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 11:11:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 363. [2025-01-09 11:11:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 239 states have (on average 1.2510460251046025) internal successors, (299), 242 states have internal predecessors, (299), 104 states have call successors, (104), 19 states have call predecessors, (104), 19 states have return successors, (104), 101 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 11:11:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 507 transitions. [2025-01-09 11:11:35,921 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 507 transitions. Word has length 196 [2025-01-09 11:11:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:35,922 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 507 transitions. [2025-01-09 11:11:35,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 6 states have call successors, (75), 3 states have call predecessors, (75), 5 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2025-01-09 11:11:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 507 transitions. [2025-01-09 11:11:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 11:11:35,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:35,924 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:35,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 11:11:36,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:36,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:36,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash 910153738, now seen corresponding path program 1 times [2025-01-09 11:11:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:36,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543849291] [2025-01-09 11:11:36,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:36,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:36,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 11:11:36,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 11:11:36,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:36,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:11:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:36,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543849291] [2025-01-09 11:11:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543849291] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:11:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104115843] [2025-01-09 11:11:36,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:36,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:36,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:36,594 INFO L229 MonitoredProcess]: Starting monitored process 4 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 11:11:36,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 11:11:36,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 11:11:36,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 11:11:36,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:36,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:36,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 11:11:36,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-01-09 11:11:37,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:11:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 54 proven. 123 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-01-09 11:11:37,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104115843] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:11:37,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:11:37,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-01-09 11:11:37,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69049656] [2025-01-09 11:11:37,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:11:37,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 11:11:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:37,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 11:11:37,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-01-09 11:11:37,639 INFO L87 Difference]: Start difference. First operand 363 states and 507 transitions. Second operand has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 8 states have call successors, (84), 3 states have call predecessors, (84), 7 states have return successors, (85), 8 states have call predecessors, (85), 8 states have call successors, (85) [2025-01-09 11:11:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:38,541 INFO L93 Difference]: Finished difference Result 743 states and 1018 transitions. [2025-01-09 11:11:38,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 11:11:38,541 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 8 states have call successors, (84), 3 states have call predecessors, (84), 7 states have return successors, (85), 8 states have call predecessors, (85), 8 states have call successors, (85) Word has length 196 [2025-01-09 11:11:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:38,544 INFO L225 Difference]: With dead ends: 743 [2025-01-09 11:11:38,544 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 11:11:38,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 11:11:38,546 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 306 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:38,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 445 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:11:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 11:11:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 415. [2025-01-09 11:11:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 272 states have (on average 1.2389705882352942) internal successors, (337), 274 states have internal predecessors, (337), 119 states have call successors, (119), 23 states have call predecessors, (119), 23 states have return successors, (119), 117 states have call predecessors, (119), 119 states have call successors, (119) [2025-01-09 11:11:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 575 transitions. [2025-01-09 11:11:38,611 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 575 transitions. Word has length 196 [2025-01-09 11:11:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:38,611 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 575 transitions. [2025-01-09 11:11:38,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 8 states have call successors, (84), 3 states have call predecessors, (84), 7 states have return successors, (85), 8 states have call predecessors, (85), 8 states have call successors, (85) [2025-01-09 11:11:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 575 transitions. [2025-01-09 11:11:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 11:11:38,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:38,613 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:38,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 11:11:38,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:38,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:38,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1453817226, now seen corresponding path program 1 times [2025-01-09 11:11:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777581449] [2025-01-09 11:11:38,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:38,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:38,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:11:38,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:11:38,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:38,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:11:38,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:38,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777581449] [2025-01-09 11:11:38,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777581449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:11:38,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731926533] [2025-01-09 11:11:38,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:38,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:38,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:38,997 INFO L229 MonitoredProcess]: Starting monitored process 5 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 11:11:39,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 11:11:39,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:11:39,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:11:39,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:39,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:39,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:11:39,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 850 proven. 60 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2025-01-09 11:11:39,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:11:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:11:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731926533] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:11:39,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:11:39,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 11:11:39,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893260417] [2025-01-09 11:11:39,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:11:39,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:11:39,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:39,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:11:39,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:11:39,454 INFO L87 Difference]: Start difference. First operand 415 states and 575 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2025-01-09 11:11:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:39,678 INFO L93 Difference]: Finished difference Result 768 states and 1052 transitions. [2025-01-09 11:11:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:11:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) Word has length 197 [2025-01-09 11:11:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:39,683 INFO L225 Difference]: With dead ends: 768 [2025-01-09 11:11:39,683 INFO L226 Difference]: Without dead ends: 441 [2025-01-09 11:11:39,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:11:39,685 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 161 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:39,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 218 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:11:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-09 11:11:39,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2025-01-09 11:11:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 284 states have (on average 1.2147887323943662) internal successors, (345), 286 states have internal predecessors, (345), 119 states have call successors, (119), 27 states have call predecessors, (119), 27 states have return successors, (119), 117 states have call predecessors, (119), 119 states have call successors, (119) [2025-01-09 11:11:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 583 transitions. [2025-01-09 11:11:39,721 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 583 transitions. Word has length 197 [2025-01-09 11:11:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:39,721 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 583 transitions. [2025-01-09 11:11:39,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2025-01-09 11:11:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 583 transitions. [2025-01-09 11:11:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 11:11:39,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:39,722 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:39,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 11:11:39,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 11:11:39,924 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:39,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash 360121397, now seen corresponding path program 1 times [2025-01-09 11:11:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:39,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287480584] [2025-01-09 11:11:39,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:39,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 11:11:39,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 11:11:39,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:39,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:11:40,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:40,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287480584] [2025-01-09 11:11:40,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287480584] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:11:40,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015740178] [2025-01-09 11:11:40,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:40,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:40,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:40,079 INFO L229 MonitoredProcess]: Starting monitored process 6 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 11:11:40,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 11:11:40,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 11:11:40,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 11:11:40,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:40,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:40,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:11:40,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 720 proven. 21 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2025-01-09 11:11:40,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:11:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:11:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015740178] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:11:40,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:11:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 11:11:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367408539] [2025-01-09 11:11:40,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:11:40,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:11:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:40,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:11:40,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:11:40,440 INFO L87 Difference]: Start difference. First operand 431 states and 583 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 11:11:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:40,627 INFO L93 Difference]: Finished difference Result 798 states and 1070 transitions. [2025-01-09 11:11:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:11:40,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 198 [2025-01-09 11:11:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:40,630 INFO L225 Difference]: With dead ends: 798 [2025-01-09 11:11:40,630 INFO L226 Difference]: Without dead ends: 459 [2025-01-09 11:11:40,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:11:40,631 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 78 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:40,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 220 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:11:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-09 11:11:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 443. [2025-01-09 11:11:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 293 states have (on average 1.1945392491467577) internal successors, (350), 295 states have internal predecessors, (350), 119 states have call successors, (119), 30 states have call predecessors, (119), 30 states have return successors, (119), 117 states have call predecessors, (119), 119 states have call successors, (119) [2025-01-09 11:11:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 588 transitions. [2025-01-09 11:11:40,679 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 588 transitions. Word has length 198 [2025-01-09 11:11:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:40,680 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 588 transitions. [2025-01-09 11:11:40,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 11:11:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 588 transitions. [2025-01-09 11:11:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 11:11:40,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:40,682 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:40,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 11:11:40,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:40,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:40,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash -660946957, now seen corresponding path program 1 times [2025-01-09 11:11:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:40,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609458526] [2025-01-09 11:11:40,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:40,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 11:11:40,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 11:11:40,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:40,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:11:41,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:11:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609458526] [2025-01-09 11:11:41,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609458526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:11:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025646159] [2025-01-09 11:11:41,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:41,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:11:41,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:41,193 INFO L229 MonitoredProcess]: Starting monitored process 7 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 11:11:41,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 11:11:41,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 11:11:41,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 11:11:41,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:41,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:41,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 11:11:41,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1218 proven. 141 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2025-01-09 11:11:42,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:11:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 84 proven. 93 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-01-09 11:11:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025646159] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:11:42,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:11:42,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 26 [2025-01-09 11:11:42,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011989018] [2025-01-09 11:11:42,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:11:42,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 11:11:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:11:42,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 11:11:42,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2025-01-09 11:11:42,541 INFO L87 Difference]: Start difference. First operand 443 states and 588 transitions. Second operand has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 10 states have call successors, (93), 5 states have call predecessors, (93), 10 states have return successors, (93), 10 states have call predecessors, (93), 10 states have call successors, (93) [2025-01-09 11:11:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:45,070 INFO L93 Difference]: Finished difference Result 1410 states and 1822 transitions. [2025-01-09 11:11:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-01-09 11:11:45,071 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 10 states have call successors, (93), 5 states have call predecessors, (93), 10 states have return successors, (93), 10 states have call predecessors, (93), 10 states have call successors, (93) Word has length 198 [2025-01-09 11:11:45,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:45,076 INFO L225 Difference]: With dead ends: 1410 [2025-01-09 11:11:45,076 INFO L226 Difference]: Without dead ends: 1087 [2025-01-09 11:11:45,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2378 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1679, Invalid=5631, Unknown=0, NotChecked=0, Total=7310 [2025-01-09 11:11:45,079 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 822 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:45,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1045 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 11:11:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-01-09 11:11:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 642. [2025-01-09 11:11:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 430 states have (on average 1.1767441860465115) internal successors, (506), 434 states have internal predecessors, (506), 166 states have call successors, (166), 45 states have call predecessors, (166), 45 states have return successors, (166), 162 states have call predecessors, (166), 166 states have call successors, (166) [2025-01-09 11:11:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 838 transitions. [2025-01-09 11:11:45,136 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 838 transitions. Word has length 198 [2025-01-09 11:11:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:45,136 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 838 transitions. [2025-01-09 11:11:45,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 10 states have call successors, (93), 5 states have call predecessors, (93), 10 states have return successors, (93), 10 states have call predecessors, (93), 10 states have call successors, (93) [2025-01-09 11:11:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 838 transitions. [2025-01-09 11:11:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 11:11:45,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:45,140 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:45,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 11:11:45,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 11:11:45,342 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:45,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash -603688655, now seen corresponding path program 1 times [2025-01-09 11:11:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:11:45,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223516823] [2025-01-09 11:11:45,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:11:45,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 11:11:45,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 11:11:45,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:45,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:11:45,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:11:45,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 11:11:45,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 11:11:45,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:45,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:11:45,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:11:45,531 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:11:45,532 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:11:45,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:11:45,535 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:11:45,651 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:11:45,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:11:45 BoogieIcfgContainer [2025-01-09 11:11:45,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:11:45,654 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:11:45,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:11:45,654 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:11:45,654 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:11:32" (3/4) ... [2025-01-09 11:11:45,656 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:11:45,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:11:45,657 INFO L158 Benchmark]: Toolchain (without parser) took 14178.44ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 132.0MB in the beginning and 162.5MB in the end (delta: -30.5MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2025-01-09 11:11:45,657 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:11:45,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.81ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 116.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:11:45,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.30ms. Allocated memory is still 167.8MB. Free memory was 116.8MB in the beginning and 113.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:11:45,657 INFO L158 Benchmark]: Boogie Preprocessor took 47.50ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 107.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:11:45,658 INFO L158 Benchmark]: RCFGBuilder took 388.26ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 82.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:11:45,658 INFO L158 Benchmark]: TraceAbstraction took 13520.28ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 82.0MB in the beginning and 162.5MB in the end (delta: -80.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:11:45,658 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 243.3MB. Free memory was 162.5MB in the beginning and 162.5MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:11:45,659 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 226.5MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.81ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 116.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.30ms. Allocated memory is still 167.8MB. Free memory was 116.8MB in the beginning and 113.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.50ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 107.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 388.26ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 82.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13520.28ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 82.0MB in the beginning and 162.5MB in the end (delta: -80.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 243.3MB. Free memory was 162.5MB in the beginning and 162.5MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 179. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int var_1_32 = 16; [L45] unsigned char var_1_40 = 1; [L46] unsigned char var_1_43 = 0; [L47] signed long int var_1_44 = -4; [L48] unsigned long int var_1_46 = 4; [L49] unsigned long int var_1_49 = 3576445681; [L50] double var_1_50 = 32.5; [L51] signed long int var_1_52 = -1; [L52] unsigned short int var_1_53 = 64; [L53] unsigned short int last_1_var_1_9 = 4; VAL [isInitial=0, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L183] isInitial = 1 [L184] FCALL initially() [L186] CALL updateLastVariables() [L176] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L129] var_1_6 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L130] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L131] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L132] var_1_8 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L133] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L134] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L135] var_1_10 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L137] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L138] var_1_12 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L139] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L140] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L141] var_1_13 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L142] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L143] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L144] var_1_18 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L145] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L146] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L147] var_1_19 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L148] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L149] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L150] var_1_20 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L152] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L153] var_1_21 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L154] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L155] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L156] var_1_22 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L157] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L158] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L159] var_1_25 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L160] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L161] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L161] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L163] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L165] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L166] var_1_30 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L167] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L169] RET assume_abort_if_not(var_1_43 >= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L170] CALL assume_abort_if_not(var_1_43 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L170] RET assume_abort_if_not(var_1_43 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L171] var_1_49 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_49 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L172] RET assume_abort_if_not(var_1_49 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L173] CALL assume_abort_if_not(var_1_49 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L173] RET assume_abort_if_not(var_1_49 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L187] RET updateVariables() [L188] CALL step() [L57] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L60] COND FALSE !(var_1_21 <= var_1_9) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L63] var_1_50 = var_1_30 [L64] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L65] COND TRUE (var_1_13 <= var_1_12) || var_1_25 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L66] COND TRUE ((((5) < 0 ) ? -(5) : (5))) < var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L67] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L72] var_1_53 = var_1_22 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L73] COND FALSE !(\read(var_1_4)) [L76] var_1_24 = (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L78] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L79] COND FALSE !(var_1_23 < var_1_23) [L90] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L92] EXPR (~ var_1_21) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L92] COND FALSE !(((~ var_1_21) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22)))) >= var_1_12) [L95] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L96] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L103] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L105] COND FALSE !((~ var_1_18) > var_1_13) [L108] var_1_52 = ((((var_1_10) < (var_1_21)) ? (var_1_10) : (var_1_21))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L110] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L113] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L115] COND FALSE !(((((4) < 0 ) ? -(4) : (4))) >= var_1_21) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=2682372094, var_1_13=-40961, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=0, var_1_50=4294967300, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 9, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2033 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1956 mSDsluCounter, 3235 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2250 mSDsCounter, 913 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4149 IncrementalHoareTripleChecker+Invalid, 5062 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 913 mSolverCounterUnsat, 985 mSDtfsCounter, 4149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2328 GetRequests, 2152 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2846 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=642occurred in iteration=8, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 607 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2952 NumberOfCodeBlocks, 2952 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3720 ConstructedInterpolants, 0 QuantifiedInterpolants, 13212 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2658 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 34236/35340 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 11:11:45,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.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 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:11:47,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:11:47,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:11:47,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:11:47,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:11:47,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:11:47,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:11:47,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:11:47,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:11:47,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:11:47,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:11:47,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:11:47,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:11:47,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:11:47,792 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:11:47,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:11:47,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:11:47,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:11:47,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:11:47,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:11:47,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:11:47,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:11:47,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:11:47,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:11:47,793 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:11:47,793 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:11:47,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:11:47,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:11:47,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:11:47,794 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:11:47,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:11:47,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:11:47,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:11:47,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:11:47,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:11:47,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:11:47,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:11:47,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:11:47,795 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 -> 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 [2025-01-09 11:11:48,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:11:48,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:11:48,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:11:48,066 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:11:48,067 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:11:48,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-01-09 11:11:49,310 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f77fe3c0b/9d1419ee8d4b492f92d0b922dceeb837/FLAG5f5cc83a5 [2025-01-09 11:11:49,529 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:11:49,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-01-09 11:11:49,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f77fe3c0b/9d1419ee8d4b492f92d0b922dceeb837/FLAG5f5cc83a5 [2025-01-09 11:11:49,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f77fe3c0b/9d1419ee8d4b492f92d0b922dceeb837 [2025-01-09 11:11:49,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:11:49,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:11:49,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:11:49,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:11:49,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:11:49,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:11:49" (1/1) ... [2025-01-09 11:11:49,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b78c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:49, skipping insertion in model container [2025-01-09 11:11:49,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:11:49" (1/1) ... [2025-01-09 11:11:49,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:11:49,988 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_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2025-01-09 11:11:50,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:11:50,056 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:11:50,065 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_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2025-01-09 11:11:50,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:11:50,101 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:11:50,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50 WrapperNode [2025-01-09 11:11:50,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:11:50,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:11:50,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:11:50,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:11:50,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,135 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2025-01-09 11:11:50,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:11:50,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:11:50,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:11:50,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:11:50,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,154 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 11:11:50,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,161 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:11:50,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:11:50,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:11:50,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:11:50,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (1/1) ... [2025-01-09 11:11:50,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:11:50,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:11:50,202 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 11:11:50,209 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 11:11:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:11:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:11:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:11:50,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:11:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:11:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:11:50,300 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:11:50,302 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:11:53,117 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 11:11:53,117 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:11:53,123 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:11:53,123 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:11:53,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:11:53 BoogieIcfgContainer [2025-01-09 11:11:53,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:11:53,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:11:53,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:11:53,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:11:53,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:11:49" (1/3) ... [2025-01-09 11:11:53,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341a726b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:11:53, skipping insertion in model container [2025-01-09 11:11:53,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:11:50" (2/3) ... [2025-01-09 11:11:53,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341a726b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:11:53, skipping insertion in model container [2025-01-09 11:11:53,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:11:53" (3/3) ... [2025-01-09 11:11:53,134 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-01-09 11:11:53,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:11:53,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:11:53,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:11:53,188 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;@18655c15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:11:53,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:11:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:11:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 11:11:53,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:53,200 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:53,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:53,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:53,204 INFO L85 PathProgramCache]: Analyzing trace with hash 673381488, now seen corresponding path program 1 times [2025-01-09 11:11:53,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:11:53,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294400008] [2025-01-09 11:11:53,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:53,213 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 11:11:53,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:11:53,215 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 11:11:53,217 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 11:11:53,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 11:11:53,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 11:11:53,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:53,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:53,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:11:53,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2025-01-09 11:11:53,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:11:53,566 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:11:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294400008] [2025-01-09 11:11:53,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294400008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:53,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:11:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:11:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122560631] [2025-01-09 11:11:53,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:53,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:11:53,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:11:53,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:11:53,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:11:53,588 INFO L87 Difference]: Start difference. First operand has 88 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:11:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:53,617 INFO L93 Difference]: Finished difference Result 167 states and 296 transitions. [2025-01-09 11:11:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:11:53,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 195 [2025-01-09 11:11:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:53,623 INFO L225 Difference]: With dead ends: 167 [2025-01-09 11:11:53,623 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 11:11:53,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 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 11:11:53,629 INFO L435 NwaCegarLoop]: 126 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, 126 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 11:11:53,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:11:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 11:11:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 11:11:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:11:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2025-01-09 11:11:53,669 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 195 [2025-01-09 11:11:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:53,669 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2025-01-09 11:11:53,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:11:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2025-01-09 11:11:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 11:11:53,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:53,673 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:53,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 11:11:53,873 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 11:11:53,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:53,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:53,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1919007018, now seen corresponding path program 1 times [2025-01-09 11:11:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:11:53,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659155770] [2025-01-09 11:11:53,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:53,876 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 11:11:53,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:11:53,881 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 11:11:53,882 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 11:11:53,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 11:11:54,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 11:11:54,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:54,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:54,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 11:11:54,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-01-09 11:11:54,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:11:55,277 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:11:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659155770] [2025-01-09 11:11:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659155770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:11:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [335268404] [2025-01-09 11:11:55,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:55,277 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:11:55,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:11:55,281 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 11:11:55,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 11:11:55,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 11:11:55,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 11:11:55,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:55,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:55,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:11:55,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:11:55,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:11:55,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [335268404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:55,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:11:55,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 11:11:55,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793348432] [2025-01-09 11:11:55,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:55,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:11:55,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:11:55,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:11:55,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:11:55,853 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:11:59,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 11:12:01,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 11:12:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:12:01,196 INFO L93 Difference]: Finished difference Result 207 states and 318 transitions. [2025-01-09 11:12:01,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:12:01,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2025-01-09 11:12:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:12:01,203 INFO L225 Difference]: With dead ends: 207 [2025-01-09 11:12:01,203 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 11:12:01,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:12:01,207 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 62 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:12:01,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 282 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-01-09 11:12:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 11:12:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2025-01-09 11:12:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 73 states have (on average 1.273972602739726) internal successors, (93), 74 states have internal predecessors, (93), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 11:12:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2025-01-09 11:12:01,249 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 195 [2025-01-09 11:12:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:12:01,250 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2025-01-09 11:12:01,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:12:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2025-01-09 11:12:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 11:12:01,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:12:01,252 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:12:01,275 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 11:12:01,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2025-01-09 11:12:01,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 11:12:01,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:12:01,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:12:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1525980008, now seen corresponding path program 1 times [2025-01-09 11:12:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:12:01,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443553910] [2025-01-09 11:12:01,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:01,656 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 11:12:01,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:12:01,662 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 11:12:01,663 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 11:12:01,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 11:12:01,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 11:12:01,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:01,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:01,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 11:12:01,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:12:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-01-09 11:12:02,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:12:02,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:12:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443553910] [2025-01-09 11:12:02,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443553910] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:12:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1814168750] [2025-01-09 11:12:02,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:02,678 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:12:02,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:12:02,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 11:12:02,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 11:12:02,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 11:12:03,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 11:12:03,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:03,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:03,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 11:12:03,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:12:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:12:03,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:12:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1814168750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:12:03,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:12:03,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-01-09 11:12:03,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196399679] [2025-01-09 11:12:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:12:03,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:12:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:12:03,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:12:03,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:12:03,565 INFO L87 Difference]: Start difference. First operand 125 states and 191 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:12:07,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:12:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:12:07,355 INFO L93 Difference]: Finished difference Result 372 states and 572 transitions. [2025-01-09 11:12:07,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:12:07,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2025-01-09 11:12:07,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:12:07,359 INFO L225 Difference]: With dead ends: 372 [2025-01-09 11:12:07,359 INFO L226 Difference]: Without dead ends: 250 [2025-01-09 11:12:07,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:12:07,360 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 110 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:12:07,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 432 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-09 11:12:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-09 11:12:07,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 196. [2025-01-09 11:12:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 112 states have (on average 1.2767857142857142) internal successors, (143), 113 states have internal predecessors, (143), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 11:12:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 303 transitions. [2025-01-09 11:12:07,392 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 303 transitions. Word has length 195 [2025-01-09 11:12:07,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:12:07,393 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 303 transitions. [2025-01-09 11:12:07,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:12:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 303 transitions. [2025-01-09 11:12:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 11:12:07,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:12:07,395 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:12:07,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-01-09 11:12:07,606 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 (5)] Forceful destruction successful, exit code 0 [2025-01-09 11:12:07,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:12:07,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:12:07,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:12:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash -62367894, now seen corresponding path program 1 times [2025-01-09 11:12:07,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:12:07,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993145380] [2025-01-09 11:12:07,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:07,799 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 11:12:07,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:12:07,802 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:12:07,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 11:12:07,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 11:12:08,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 11:12:08,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:08,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:08,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 11:12:08,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:12:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-01-09 11:12:08,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:12:08,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:12:08,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993145380] [2025-01-09 11:12:08,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993145380] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:12:08,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [645521589] [2025-01-09 11:12:08,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:08,839 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:12:08,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:12:08,841 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 11:12:08,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-01-09 11:12:08,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 11:12:09,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 11:12:09,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:09,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:09,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 11:12:09,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:12:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 850 proven. 60 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2025-01-09 11:12:09,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:12:09,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [645521589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:12:09,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:12:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2025-01-09 11:12:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588105554] [2025-01-09 11:12:09,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:12:09,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:12:09,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:12:09,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:12:09,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:12:09,618 INFO L87 Difference]: Start difference. First operand 196 states and 303 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 4 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2025-01-09 11:12:11,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:12:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:12:11,952 INFO L93 Difference]: Finished difference Result 364 states and 530 transitions. [2025-01-09 11:12:11,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:12:11,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 4 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) Word has length 195 [2025-01-09 11:12:11,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:12:11,974 INFO L225 Difference]: With dead ends: 364 [2025-01-09 11:12:11,975 INFO L226 Difference]: Without dead ends: 231 [2025-01-09 11:12:11,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:12:11,977 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 74 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:12:11,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 240 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 11:12:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-01-09 11:12:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 225. [2025-01-09 11:12:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 132 states have (on average 1.143939393939394) internal successors, (151), 133 states have internal predecessors, (151), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 11:12:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2025-01-09 11:12:12,006 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 195 [2025-01-09 11:12:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:12:12,006 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2025-01-09 11:12:12,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 4 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2025-01-09 11:12:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2025-01-09 11:12:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 11:12:12,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:12:12,013 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:12:12,024 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 (7)] Forceful destruction successful, exit code 0 [2025-01-09 11:12:12,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-01-09 11:12:12,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 11:12:12,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:12:12,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:12:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1443021215, now seen corresponding path program 1 times [2025-01-09 11:12:12,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:12:12,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450796073] [2025-01-09 11:12:12,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:12,417 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 11:12:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:12:12,420 INFO L229 MonitoredProcess]: Starting monitored process 9 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 11:12:12,420 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 (9)] Waiting until timeout for monitored process [2025-01-09 11:12:12,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:12:12,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:12:12,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:12,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:12,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:12:12,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:12:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 720 proven. 21 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2025-01-09 11:12:12,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:12:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:12:13,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:12:13,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450796073] [2025-01-09 11:12:13,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450796073] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:12:13,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:12:13,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 11:12:13,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325603875] [2025-01-09 11:12:13,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:12:13,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:12:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:12:13,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:12:13,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:12:13,267 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 11:12:15,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:12:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:12:15,635 INFO L93 Difference]: Finished difference Result 393 states and 533 transitions. [2025-01-09 11:12:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:12:15,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 197 [2025-01-09 11:12:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:12:15,658 INFO L225 Difference]: With dead ends: 393 [2025-01-09 11:12:15,658 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 11:12:15,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 386 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:12:15,660 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 153 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:12:15,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 186 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 11:12:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 11:12:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 233. [2025-01-09 11:12:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 139 states have internal predecessors, (155), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 11:12:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 315 transitions. [2025-01-09 11:12:15,686 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 315 transitions. Word has length 197 [2025-01-09 11:12:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:12:15,686 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 315 transitions. [2025-01-09 11:12:15,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 11:12:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 315 transitions. [2025-01-09 11:12:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 11:12:15,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:12:15,688 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:12:15,700 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 (9)] Ended with exit code 0 [2025-01-09 11:12:15,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 11:12:15,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:12:15,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:12:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1572082403, now seen corresponding path program 1 times [2025-01-09 11:12:15,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:12:15,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801994566] [2025-01-09 11:12:15,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:15,893 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 11:12:15,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:12:15,895 INFO L229 MonitoredProcess]: Starting monitored process 10 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 11:12:15,899 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 (10)] Waiting until timeout for monitored process [2025-01-09 11:12:15,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:12:16,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:12:16,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:16,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:16,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 11:12:16,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:12:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1196 proven. 144 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-01-09 11:12:17,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:12:17,185 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:12:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801994566] [2025-01-09 11:12:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801994566] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:12:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [52514605] [2025-01-09 11:12:17,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:17,186 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:12:17,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:12:17,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 11:12:17,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-01-09 11:12:17,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:12:17,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:12:17,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:17,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:17,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 11:12:17,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:12:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 850 proven. 60 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2025-01-09 11:12:18,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:12:18,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [52514605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:12:18,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:12:18,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2025-01-09 11:12:18,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347810013] [2025-01-09 11:12:18,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:12:18,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:12:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:12:18,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:12:18,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:12:18,220 INFO L87 Difference]: Start difference. First operand 233 states and 315 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 4 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2025-01-09 11:12:20,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:12:22,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:12:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:12:22,930 INFO L93 Difference]: Finished difference Result 414 states and 541 transitions. [2025-01-09 11:12:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 11:12:22,930 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 4 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) Word has length 197 [2025-01-09 11:12:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:12:22,935 INFO L225 Difference]: With dead ends: 414 [2025-01-09 11:12:22,935 INFO L226 Difference]: Without dead ends: 252 [2025-01-09 11:12:22,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2025-01-09 11:12:22,936 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 114 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:12:22,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 305 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 11:12:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-09 11:12:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2025-01-09 11:12:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 139 states have (on average 1.064748201438849) internal successors, (148), 140 states have internal predecessors, (148), 80 states have call successors, (80), 19 states have call predecessors, (80), 19 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 11:12:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 308 transitions. [2025-01-09 11:12:22,965 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 308 transitions. Word has length 197 [2025-01-09 11:12:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:12:22,970 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 308 transitions. [2025-01-09 11:12:22,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 4 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2025-01-09 11:12:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 308 transitions. [2025-01-09 11:12:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 11:12:22,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:12:22,971 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:12:22,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-01-09 11:12:23,180 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 (10)] Forceful destruction successful, exit code 0 [2025-01-09 11:12:23,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /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 11:12:23,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:12:23,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:12:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1629340705, now seen corresponding path program 1 times [2025-01-09 11:12:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:12:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697747947] [2025-01-09 11:12:23,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:23,374 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 11:12:23,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:12:23,376 INFO L229 MonitoredProcess]: Starting monitored process 12 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 11:12:23,376 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 (12)] Waiting until timeout for monitored process [2025-01-09 11:12:23,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:12:23,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:12:23,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:23,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:23,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 11:12:23,722 INFO L279 TraceCheckSpWp]: Computing forward predicates...