./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.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 a7327b2df7c4359abf51049746e044c1d2b1b08c2a17a4cad44bc7507fef78cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:55:27,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:55:27,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:55:27,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:55:27,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:55:27,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:55:27,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:55:27,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:55:27,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:55:27,220 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:55:27,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:55:27,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:55:27,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:55:27,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:55:27,221 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:55:27,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:55:27,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:55:27,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:55:27,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:55:27,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:55:27,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:55:27,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:55:27,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:55:27,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:55:27,222 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:55:27,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:55:27,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:55:27,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:55:27,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:55:27,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:55:27,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:55:27,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:55:27,224 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 -> a7327b2df7c4359abf51049746e044c1d2b1b08c2a17a4cad44bc7507fef78cc [2025-02-05 23:55:27,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:55:27,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:55:27,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:55:27,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:55:27,569 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:55:27,570 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-ps-co_file-18.i [2025-02-05 23:55:28,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0e98caed/f5f813b3a82a4e2783c013eac36b3b86/FLAGe42b2fc9b [2025-02-05 23:55:29,140 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:55:29,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i [2025-02-05 23:55:29,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0e98caed/f5f813b3a82a4e2783c013eac36b3b86/FLAGe42b2fc9b [2025-02-05 23:55:29,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0e98caed/f5f813b3a82a4e2783c013eac36b3b86 [2025-02-05 23:55:29,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:55:29,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:55:29,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:55:29,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:55:29,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:55:29,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b88f9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29, skipping insertion in model container [2025-02-05 23:55:29,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:55:29,336 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-ps-co_file-18.i[919,932] [2025-02-05 23:55:29,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:55:29,408 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:55:29,415 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-ps-co_file-18.i[919,932] [2025-02-05 23:55:29,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:55:29,469 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:55:29,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29 WrapperNode [2025-02-05 23:55:29,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:55:29,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:55:29,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:55:29,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:55:29,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,511 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-02-05 23:55:29,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:55:29,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:55:29,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:55:29,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:55:29,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,534 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 23:55:29,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:55:29,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:55:29,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:55:29,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:55:29,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (1/1) ... [2025-02-05 23:55:29,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:55:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:55:29,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:55:29,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:55:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:55:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:55:29,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:55:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:55:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:55:29,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:55:29,702 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:55:29,704 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:55:30,050 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 23:55:30,051 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:55:30,066 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:55:30,067 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:55:30,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:55:30 BoogieIcfgContainer [2025-02-05 23:55:30,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:55:30,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:55:30,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:55:30,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:55:30,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:55:29" (1/3) ... [2025-02-05 23:55:30,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cc419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:55:30, skipping insertion in model container [2025-02-05 23:55:30,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:29" (2/3) ... [2025-02-05 23:55:30,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cc419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:55:30, skipping insertion in model container [2025-02-05 23:55:30,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:55:30" (3/3) ... [2025-02-05 23:55:30,078 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i [2025-02-05 23:55:30,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:55:30,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:55:30,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:55:30,151 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;@4ffbe250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:55:30,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:55:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 23:55:30,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 23:55:30,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:30,175 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:55:30,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:30,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1979468860, now seen corresponding path program 1 times [2025-02-05 23:55:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:30,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267856634] [2025-02-05 23:55:30,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:30,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 23:55:30,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 23:55:30,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:30,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-02-05 23:55:30,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:30,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267856634] [2025-02-05 23:55:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267856634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:55:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348110543] [2025-02-05 23:55:30,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:30,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:55:30,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:55:30,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:55:30,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 23:55:30,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 23:55:30,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 23:55:30,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:30,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:30,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:55:30,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:55:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-02-05 23:55:30,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:55:30,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348110543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:30,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:55:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:55:30,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889326996] [2025-02-05 23:55:30,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:30,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:55:30,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:30,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:55:30,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:55:30,813 INFO L87 Difference]: Start difference. First operand has 95 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 23:55:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:30,846 INFO L93 Difference]: Finished difference Result 184 states and 324 transitions. [2025-02-05 23:55:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:55:30,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 189 [2025-02-05 23:55:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:30,857 INFO L225 Difference]: With dead ends: 184 [2025-02-05 23:55:30,858 INFO L226 Difference]: Without dead ends: 92 [2025-02-05 23:55:30,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:55:30,863 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:30,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:55:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-05 23:55:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-05 23:55:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 23:55:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 145 transitions. [2025-02-05 23:55:30,913 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 145 transitions. Word has length 189 [2025-02-05 23:55:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:30,914 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 145 transitions. [2025-02-05 23:55:30,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 23:55:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 145 transitions. [2025-02-05 23:55:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 23:55:30,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:30,921 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:55:30,930 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-02-05 23:55:31,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 23:55:31,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:31,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1513155191, now seen corresponding path program 1 times [2025-02-05 23:55:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:31,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775283973] [2025-02-05 23:55:31,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:31,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 23:55:31,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 23:55:31,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:31,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 23:55:31,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:31,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775283973] [2025-02-05 23:55:31,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775283973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:31,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:31,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:55:31,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798215591] [2025-02-05 23:55:31,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:31,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:55:31,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:31,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:55:31,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:55:31,500 INFO L87 Difference]: Start difference. First operand 92 states and 145 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:55:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:31,577 INFO L93 Difference]: Finished difference Result 264 states and 423 transitions. [2025-02-05 23:55:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:55:31,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 189 [2025-02-05 23:55:31,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:31,582 INFO L225 Difference]: With dead ends: 264 [2025-02-05 23:55:31,586 INFO L226 Difference]: Without dead ends: 175 [2025-02-05 23:55:31,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:55:31,587 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 81 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:31,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 269 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:55:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-05 23:55:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 148. [2025-02-05 23:55:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 87 states have internal predecessors, (115), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 23:55:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 231 transitions. [2025-02-05 23:55:31,631 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 231 transitions. Word has length 189 [2025-02-05 23:55:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:31,632 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 231 transitions. [2025-02-05 23:55:31,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:55:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 231 transitions. [2025-02-05 23:55:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 23:55:31,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:31,634 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:55:31,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:55:31,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:31,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash 233119659, now seen corresponding path program 1 times [2025-02-05 23:55:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:31,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322872356] [2025-02-05 23:55:31,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:31,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 23:55:31,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 23:55:31,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:31,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 23:55:31,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:31,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322872356] [2025-02-05 23:55:31,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322872356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:31,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:31,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:55:31,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324016107] [2025-02-05 23:55:31,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:31,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:55:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:31,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:55:31,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:55:31,877 INFO L87 Difference]: Start difference. First operand 148 states and 231 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:55:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:31,955 INFO L93 Difference]: Finished difference Result 260 states and 415 transitions. [2025-02-05 23:55:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:55:31,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-02-05 23:55:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:31,958 INFO L225 Difference]: With dead ends: 260 [2025-02-05 23:55:31,958 INFO L226 Difference]: Without dead ends: 171 [2025-02-05 23:55:31,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:55:31,962 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 72 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:31,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 259 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:55:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-05 23:55:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 150. [2025-02-05 23:55:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 23:55:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 234 transitions. [2025-02-05 23:55:32,003 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 234 transitions. Word has length 190 [2025-02-05 23:55:32,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:32,004 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 234 transitions. [2025-02-05 23:55:32,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:55:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 234 transitions. [2025-02-05 23:55:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 23:55:32,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:32,010 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:55:32,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:55:32,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:32,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:32,011 INFO L85 PathProgramCache]: Analyzing trace with hash -809142776, now seen corresponding path program 1 times [2025-02-05 23:55:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:32,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673968005] [2025-02-05 23:55:32,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:32,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 23:55:32,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 23:55:32,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:32,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 23:55:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673968005] [2025-02-05 23:55:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673968005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:55:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791389726] [2025-02-05 23:55:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:55:32,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:32,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:55:32,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:55:32,222 INFO L87 Difference]: Start difference. First operand 150 states and 234 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:55:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:32,289 INFO L93 Difference]: Finished difference Result 254 states and 403 transitions. [2025-02-05 23:55:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:55:32,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2025-02-05 23:55:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:32,294 INFO L225 Difference]: With dead ends: 254 [2025-02-05 23:55:32,295 INFO L226 Difference]: Without dead ends: 165 [2025-02-05 23:55:32,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:55:32,296 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 55 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:32,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 255 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:55:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-05 23:55:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2025-02-05 23:55:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 23:55:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2025-02-05 23:55:32,328 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 251 transitions. Word has length 192 [2025-02-05 23:55:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:32,329 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 251 transitions. [2025-02-05 23:55:32,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:55:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 251 transitions. [2025-02-05 23:55:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 23:55:32,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:32,332 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:55:32,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:55:32,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:32,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash 698409033, now seen corresponding path program 1 times [2025-02-05 23:55:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327199220] [2025-02-05 23:55:32,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:32,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 23:55:32,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 23:55:32,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:32,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 23:55:32,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:32,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327199220] [2025-02-05 23:55:32,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327199220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:32,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:32,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:55:32,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162852570] [2025-02-05 23:55:32,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:32,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:55:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:32,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:55:32,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:55:32,537 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:55:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:32,626 INFO L93 Difference]: Finished difference Result 255 states and 403 transitions. [2025-02-05 23:55:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:55:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2025-02-05 23:55:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:32,630 INFO L225 Difference]: With dead ends: 255 [2025-02-05 23:55:32,630 INFO L226 Difference]: Without dead ends: 165 [2025-02-05 23:55:32,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:55:32,632 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 63 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:32,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 378 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:55:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-05 23:55:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2025-02-05 23:55:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 23:55:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 250 transitions. [2025-02-05 23:55:32,665 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 250 transitions. Word has length 192 [2025-02-05 23:55:32,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:32,667 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 250 transitions. [2025-02-05 23:55:32,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:55:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 250 transitions. [2025-02-05 23:55:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 23:55:32,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:32,669 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:55:32,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:55:32,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:32,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash 187874856, now seen corresponding path program 1 times [2025-02-05 23:55:32,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:32,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511520105] [2025-02-05 23:55:32,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:32,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 23:55:32,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 23:55:32,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:32,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 23:55:32,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511520105] [2025-02-05 23:55:32,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511520105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:32,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:32,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:55:32,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754196566] [2025-02-05 23:55:32,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:32,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:55:32,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:32,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:55:32,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:55:32,972 INFO L87 Difference]: Start difference. First operand 160 states and 250 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 23:55:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:33,288 INFO L93 Difference]: Finished difference Result 290 states and 457 transitions. [2025-02-05 23:55:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:55:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2025-02-05 23:55:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:33,291 INFO L225 Difference]: With dead ends: 290 [2025-02-05 23:55:33,291 INFO L226 Difference]: Without dead ends: 194 [2025-02-05 23:55:33,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:55:33,293 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 214 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:33,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 402 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:55:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-05 23:55:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 171. [2025-02-05 23:55:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 58 states have call successors, (58), 3 states have call predecessors, (58), 3 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 23:55:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 263 transitions. [2025-02-05 23:55:33,317 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 263 transitions. Word has length 192 [2025-02-05 23:55:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:33,318 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 263 transitions. [2025-02-05 23:55:33,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 23:55:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 263 transitions. [2025-02-05 23:55:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 23:55:33,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:33,320 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:55:33,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:55:33,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:33,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash -656597015, now seen corresponding path program 1 times [2025-02-05 23:55:33,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:33,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606668867] [2025-02-05 23:55:33,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:33,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:33,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 23:55:33,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 23:55:33,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:33,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 23:55:33,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039089100] [2025-02-05 23:55:33,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:33,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:55:33,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:55:33,448 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-02-05 23:55:33,450 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-02-05 23:55:33,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 23:55:33,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 23:55:33,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:33,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:55:33,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 23:55:33,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 23:55:33,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 23:55:33,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:33,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:55:33,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 23:55:33,841 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 23:55:33,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 23:55:33,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 23:55:34,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:55:34,051 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:55:34,187 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 23:55:34,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:55:34 BoogieIcfgContainer [2025-02-05 23:55:34,190 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 23:55:34,191 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 23:55:34,191 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 23:55:34,191 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 23:55:34,192 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:55:30" (3/4) ... [2025-02-05 23:55:34,194 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 23:55:34,194 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 23:55:34,195 INFO L158 Benchmark]: Toolchain (without parser) took 5013.22ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 95.3MB in the end (delta: 27.3MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2025-02-05 23:55:34,195 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:55:34,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.78ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 107.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 23:55:34,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.18ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 104.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:55:34,196 INFO L158 Benchmark]: Boogie Preprocessor took 36.96ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 101.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:55:34,196 INFO L158 Benchmark]: IcfgBuilder took 517.26ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 76.8MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 23:55:34,196 INFO L158 Benchmark]: TraceAbstraction took 4120.37ms. Allocated memory is still 167.8MB. Free memory was 76.2MB in the beginning and 95.4MB in the end (delta: -19.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:55:34,196 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 95.3MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:55:34,197 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.18ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.78ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 107.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.18ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 104.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.96ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 101.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 517.26ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 76.8MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4120.37ms. Allocated memory is still 167.8MB. Free memory was 76.2MB in the beginning and 95.4MB in the end (delta: -19.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 95.3MB in the end (delta: 30.1kB). 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 someBinaryArithmeticDOUBLEoperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 195, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 195, overapproximation of someBinaryArithmeticFLOAToperation at line 113. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -1; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 5.5; [L25] float var_1_5 = 255.475; [L26] unsigned char var_1_7 = 0; [L27] signed char var_1_8 = -5; [L28] signed char var_1_9 = 2; [L29] unsigned char var_1_10 = 16; [L30] unsigned char var_1_11 = 16; [L31] float var_1_12 = 10000000.8; [L32] float var_1_13 = 127.7; [L33] float var_1_14 = 199.2; [L34] float var_1_15 = 999999.5; [L35] signed long int var_1_16 = -8; [L36] signed short int var_1_18 = -8; [L37] double var_1_19 = 5.4; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; [L40] signed char var_1_22 = 1; [L41] signed short int var_1_25 = 32; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 0; [L44] unsigned long int var_1_29 = 5; [L45] unsigned long int var_1_30 = 4; [L46] unsigned char var_1_31 = 2; [L47] unsigned char var_1_34 = 5; [L48] unsigned char var_1_35 = 25; [L49] unsigned char var_1_36 = 10; [L50] unsigned short int var_1_37 = 64; [L51] unsigned short int var_1_38 = 16; [L52] signed long int var_1_39 = -50; [L53] signed char last_1_var_1_1 = -1; [L54] unsigned char last_1_var_1_10 = 16; [L55] signed long int last_1_var_1_16 = -8; VAL [isInitial=0, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L190] last_1_var_1_1 = var_1_1 [L191] last_1_var_1_10 = var_1_10 [L192] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L202] RET updateLastVariables() [L203] CALL updateVariables() [L142] var_1_3 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L143] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L144] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L145] var_1_4 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L146] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L147] var_1_5 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L148] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L152] var_1_8 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=2] [L153] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=2] [L154] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=2] [L154] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=2] [L155] var_1_9 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L156] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L157] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L157] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L158] var_1_11 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L159] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L160] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L160] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L161] var_1_13 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L162] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L163] var_1_14 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L164] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L165] var_1_15 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L166] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L167] var_1_21 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L168] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L169] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L169] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L170] var_1_25 = __VERIFIER_nondet_short() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L172] CALL assume_abort_if_not(var_1_25 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L172] RET assume_abort_if_not(var_1_25 <= 32) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L173] var_1_28 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L174] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L175] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L175] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L176] var_1_30 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L177] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L178] CALL assume_abort_if_not(var_1_30 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L178] RET assume_abort_if_not(var_1_30 <= 8) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L179] var_1_34 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L180] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L181] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L181] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L182] var_1_35 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L183] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L184] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L184] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L185] var_1_36 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L186] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L187] CALL assume_abort_if_not(var_1_36 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L187] RET assume_abort_if_not(var_1_36 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L203] RET updateVariables() [L204] CALL step() [L59] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L60] EXPR var_1_16 >> var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L60] COND TRUE var_1_1 > ((var_1_16 >> var_1_25) * var_1_10) [L61] var_1_22 = var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L63] COND TRUE (-128 >> 10u) >= var_1_18 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L64] COND TRUE var_1_18 >= (var_1_18 + var_1_25) [L65] var_1_27 = (var_1_21 || var_1_28) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L68] COND TRUE 64 >= (10 * var_1_1) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L69] EXPR var_1_1 >> var_1_30 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L69] COND FALSE !(var_1_25 <= (var_1_1 >> var_1_30)) [L72] var_1_29 = var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L75] EXPR var_1_30 & var_1_10 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L75] COND FALSE !(var_1_1 < (var_1_30 & var_1_10)) [L80] COND FALSE !(var_1_16 >= var_1_10) [L83] var_1_37 = ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L85] COND FALSE !(var_1_18 < var_1_16) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-7, var_1_9=-8] [L88] COND TRUE 100.75 >= ((((var_1_12 + var_1_19) < 0 ) ? -(var_1_12 + var_1_19) : (var_1_12 + var_1_19))) [L89] var_1_39 = ((((var_1_16) < (var_1_34)) ? (var_1_16) : (var_1_34))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L91] signed long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_0=-8, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L92] COND FALSE !(var_1_9 < stepLocal_0) [L97] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L99] COND TRUE \read(var_1_7) [L100] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=-7, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L104] signed long int stepLocal_2 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=-7, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L105] COND TRUE ! (last_1_var_1_1 > last_1_var_1_10) [L106] var_1_19 = ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_13=2, var_1_14=0, var_1_16=-7, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L112] COND TRUE var_1_5 <= (var_1_19 / var_1_3) [L113] var_1_12 = ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=-7, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L117] COND FALSE !((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) [L124] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=-7, var_1_18=-8, var_1_19=2, var_1_1=-7, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L126] signed char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_1=-7, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=-7, var_1_18=-8, var_1_19=2, var_1_1=-7, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L127] COND FALSE !(stepLocal_1 >= (var_1_16 + var_1_10)) [L138] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=-7, var_1_18=-7, var_1_19=2, var_1_1=-7, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L204] RET step() [L205] CALL, EXPR property() [L195-L196] return (((((((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) ? (var_1_7 ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_9))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_9 < last_1_var_1_16) ? (((var_1_4 - var_1_5) > var_1_3) ? (var_1_10 == ((unsigned char) 8)) : 1) : (var_1_10 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_19 / var_1_3)) ? (var_1_12 == ((float) ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) : (var_1_12 == ((float) var_1_14)))) && (var_1_7 ? (var_1_16 == ((signed long int) var_1_8)) : (var_1_16 == ((signed long int) (var_1_11 - ((((var_1_10 - var_1_10) < 0 ) ? -(var_1_10 - var_1_10) : (var_1_10 - var_1_10)))))))) && ((var_1_1 >= (var_1_16 + var_1_10)) ? ((var_1_5 < 999.5f) ? (var_1_7 ? (var_1_18 == ((signed short int) (var_1_16 + var_1_16))) : (var_1_18 == ((signed short int) var_1_8))) : (var_1_18 == ((signed short int) var_1_9))) : (var_1_18 == ((signed short int) var_1_8)))) && ((! (last_1_var_1_1 > last_1_var_1_10)) ? (var_1_19 == ((double) ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))))) : ((last_1_var_1_10 > var_1_9) ? (var_1_19 == ((double) var_1_15)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=-7, var_1_18=-7, var_1_19=2, var_1_1=-7, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=-7, var_1_18=-7, var_1_19=2, var_1_1=-7, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=-7, var_1_18=-7, var_1_19=2, var_1_1=-7, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=-7, var_1_9=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 485 mSDsluCounter, 1705 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 895 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 810 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=6, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 81 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1717 NumberOfCodeBlocks, 1717 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1326 ConstructedInterpolants, 0 QuantifiedInterpolants, 2732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 11312/11368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 23:55:34,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.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 a7327b2df7c4359abf51049746e044c1d2b1b08c2a17a4cad44bc7507fef78cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:55:36,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:55:36,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 23:55:36,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:55:36,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:55:36,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:55:36,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:55:36,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:55:36,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:55:36,538 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:55:36,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:55:36,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:55:36,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:55:36,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:55:36,540 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:55:36,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:55:36,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:55:36,541 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:55:36,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:55:36,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:55:36,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:55:36,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:55:36,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:55:36,542 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 23:55:36,542 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 23:55:36,542 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 23:55:36,542 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:55:36,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:55:36,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:55:36,542 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:55:36,543 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:55:36,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:55:36,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:55:36,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:55:36,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:55:36,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:55:36,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:55:36,544 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:55:36,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:55:36,544 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 23:55:36,544 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 23:55:36,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:55:36,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:55:36,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:55:36,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:55:36,545 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 -> a7327b2df7c4359abf51049746e044c1d2b1b08c2a17a4cad44bc7507fef78cc [2025-02-05 23:55:36,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:55:36,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:55:36,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:55:36,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:55:36,847 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:55:36,848 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-ps-co_file-18.i [2025-02-05 23:55:38,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dc6e4a5e/6cdd4dc4202d485383b364e0afca5630/FLAGffa051c52 [2025-02-05 23:55:38,435 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:55:38,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i [2025-02-05 23:55:38,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dc6e4a5e/6cdd4dc4202d485383b364e0afca5630/FLAGffa051c52 [2025-02-05 23:55:38,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dc6e4a5e/6cdd4dc4202d485383b364e0afca5630 [2025-02-05 23:55:38,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:55:38,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:55:38,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:55:38,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:55:38,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:55:38,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b2ca62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38, skipping insertion in model container [2025-02-05 23:55:38,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:55:38,627 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-ps-co_file-18.i[919,932] [2025-02-05 23:55:38,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:55:38,729 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:55:38,738 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-ps-co_file-18.i[919,932] [2025-02-05 23:55:38,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:55:38,791 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:55:38,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38 WrapperNode [2025-02-05 23:55:38,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:55:38,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:55:38,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:55:38,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:55:38,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,851 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2025-02-05 23:55:38,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:55:38,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:55:38,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:55:38,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:55:38,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,890 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 23:55:38,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:55:38,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:55:38,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:55:38,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:55:38,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (1/1) ... [2025-02-05 23:55:38,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:55:38,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:55:38,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:55:38,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:55:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:55:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 23:55:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:55:38,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:55:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:55:38,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:55:39,064 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:55:39,066 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:56:12,422 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 23:56:12,423 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:56:12,433 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:56:12,433 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:56:12,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:56:12 BoogieIcfgContainer [2025-02-05 23:56:12,434 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:56:12,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:56:12,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:56:12,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:56:12,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:55:38" (1/3) ... [2025-02-05 23:56:12,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54fa2789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:56:12, skipping insertion in model container [2025-02-05 23:56:12,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:38" (2/3) ... [2025-02-05 23:56:12,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54fa2789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:56:12, skipping insertion in model container [2025-02-05 23:56:12,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:56:12" (3/3) ... [2025-02-05 23:56:12,446 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i [2025-02-05 23:56:12,458 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:56:12,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:56:12,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:56:12,515 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;@14c1a54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:56:12,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:56:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 23:56:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 23:56:12,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:56:12,533 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:56:12,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:56:12,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:56:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1410946984, now seen corresponding path program 1 times [2025-02-05 23:56:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:56:12,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193327956] [2025-02-05 23:56:12,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:56:12,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:56:12,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:56:12,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:56:12,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 23:56:12,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 23:56:13,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 23:56:13,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:56:13,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:56:13,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:56:13,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:56:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2025-02-05 23:56:13,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:56:13,961 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:56:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193327956] [2025-02-05 23:56:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193327956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:56:13,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:56:13,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 23:56:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573908507] [2025-02-05 23:56:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:56:13,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:56:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:56:13,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:56:13,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:56:13,992 INFO L87 Difference]: Start difference. First operand has 88 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 23:56:14,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:56:14,022 INFO L93 Difference]: Finished difference Result 170 states and 302 transitions. [2025-02-05 23:56:14,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:56:14,023 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2025-02-05 23:56:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:56:14,032 INFO L225 Difference]: With dead ends: 170 [2025-02-05 23:56:14,033 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 23:56:14,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:56:14,040 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:56:14,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:56:14,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 23:56:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-05 23:56:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 23:56:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2025-02-05 23:56:14,081 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 187 [2025-02-05 23:56:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:56:14,081 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2025-02-05 23:56:14,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 23:56:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2025-02-05 23:56:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 23:56:14,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:56:14,085 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:56:14,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 23:56:14,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:56:14,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:56:14,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:56:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1875265699, now seen corresponding path program 1 times [2025-02-05 23:56:14,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:56:14,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111982322] [2025-02-05 23:56:14,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:56:14,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:56:14,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:56:14,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:56:14,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 23:56:14,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 23:56:15,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 23:56:15,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:56:15,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:56:15,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 23:56:15,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:56:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 23:56:21,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:56:21,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:56:21,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111982322] [2025-02-05 23:56:21,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111982322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:56:21,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:56:21,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 23:56:21,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654177852] [2025-02-05 23:56:21,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:56:21,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:56:21,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:56:21,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:56:21,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:56:21,738 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:56:26,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:56:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:56:26,719 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2025-02-05 23:56:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:56:26,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-02-05 23:56:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:56:26,724 INFO L225 Difference]: With dead ends: 243 [2025-02-05 23:56:26,729 INFO L226 Difference]: Without dead ends: 161 [2025-02-05 23:56:26,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:56:26,731 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 39 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-05 23:56:26,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 249 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-02-05 23:56:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-05 23:56:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2025-02-05 23:56:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 23:56:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 217 transitions. [2025-02-05 23:56:26,763 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 217 transitions. Word has length 187 [2025-02-05 23:56:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:56:26,764 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 217 transitions. [2025-02-05 23:56:26,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:56:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 217 transitions. [2025-02-05 23:56:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 23:56:26,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:56:26,771 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:56:26,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-05 23:56:26,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:56:26,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:56:26,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:56:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1474105963, now seen corresponding path program 1 times [2025-02-05 23:56:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:56:26,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391941845] [2025-02-05 23:56:26,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:56:26,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:56:26,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:56:26,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:56:26,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 23:56:27,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 23:56:28,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 23:56:28,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:56:28,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:56:28,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 23:56:28,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:56:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 23:56:34,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:56:34,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:56:34,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391941845] [2025-02-05 23:56:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391941845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:56:34,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:56:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 23:56:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277413036] [2025-02-05 23:56:34,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:56:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:56:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:56:34,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:56:34,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:56:34,682 INFO L87 Difference]: Start difference. First operand 139 states and 217 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:56:39,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:56:43,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:56:48,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:56:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:56:48,035 INFO L93 Difference]: Finished difference Result 238 states and 380 transitions. [2025-02-05 23:56:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:56:48,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2025-02-05 23:56:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:56:48,104 INFO L225 Difference]: With dead ends: 238 [2025-02-05 23:56:48,104 INFO L226 Difference]: Without dead ends: 156 [2025-02-05 23:56:48,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:56:48,107 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:56:48,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 244 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2025-02-05 23:56:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-05 23:56:48,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2025-02-05 23:56:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 23:56:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 223 transitions. [2025-02-05 23:56:48,128 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 223 transitions. Word has length 188 [2025-02-05 23:56:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:56:48,129 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 223 transitions. [2025-02-05 23:56:48,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:56:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 223 transitions. [2025-02-05 23:56:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 23:56:48,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:56:48,136 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:56:48,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 23:56:48,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:56:48,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:56:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:56:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1204709308, now seen corresponding path program 1 times [2025-02-05 23:56:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:56:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877394088] [2025-02-05 23:56:48,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:56:48,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:56:48,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:56:48,342 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-02-05 23:56:48,344 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-02-05 23:56:48,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 23:56:49,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 23:56:49,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:56:49,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:56:49,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 23:56:49,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:56:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 23:56:56,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:56:56,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:56:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877394088] [2025-02-05 23:56:56,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877394088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:56:56,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:56:56,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 23:56:56,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935244998] [2025-02-05 23:56:56,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:56:56,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:56:56,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:56:56,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:56:56,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:56:56,515 INFO L87 Difference]: Start difference. First operand 143 states and 223 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 23:57:01,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []