./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-89.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-89.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f94795b0f3f196f896b0d5b400dc38ed7472f9ce0750288d10d137d9782004a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:05:08,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:05:08,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:05:08,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:05:08,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:05:08,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:05:08,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:05:08,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:05:08,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:05:08,895 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:05:08,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:05:08,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:05:08,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:05:08,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:05:08,897 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:05:08,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:05:08,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:05:08,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:05:08,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:05:08,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:05:08,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:05:08,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:05:08,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:05:08,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:05:08,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:05:08,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:05:08,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:05:08,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:05:08,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:05:08,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:05:08,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:05:08,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:05:08,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:05:08,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:05:08,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:05:08,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:05:08,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:05:08,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:05:08,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:05:08,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:05:08,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:05:08,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:05:08,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:05:08,901 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 -> 1f94795b0f3f196f896b0d5b400dc38ed7472f9ce0750288d10d137d9782004a [2025-02-06 00:05:09,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:05:09,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:05:09,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:05:09,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:05:09,271 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:05:09,272 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-89.i [2025-02-06 00:05:10,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9db9e4ca6/263fa0e0f11643a68077f42fabaf8257/FLAGe4266eb64 [2025-02-06 00:05:10,931 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:05:10,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i [2025-02-06 00:05:10,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9db9e4ca6/263fa0e0f11643a68077f42fabaf8257/FLAGe4266eb64 [2025-02-06 00:05:10,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9db9e4ca6/263fa0e0f11643a68077f42fabaf8257 [2025-02-06 00:05:10,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:05:10,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:05:10,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:05:10,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:05:10,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:05:10,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:05:10" (1/1) ... [2025-02-06 00:05:10,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6458cf47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:10, skipping insertion in model container [2025-02-06 00:05:10,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:05:10" (1/1) ... [2025-02-06 00:05:10,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:05:11,102 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-89.i[919,932] [2025-02-06 00:05:11,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:05:11,192 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:05:11,202 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-89.i[919,932] [2025-02-06 00:05:11,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:05:11,274 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:05:11,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11 WrapperNode [2025-02-06 00:05:11,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:05:11,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:05:11,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:05:11,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:05:11,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,321 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-02-06 00:05:11,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:05:11,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:05:11,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:05:11,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:05:11,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,354 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-06 00:05:11,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:05:11,387 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:05:11,388 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:05:11,388 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:05:11,389 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (1/1) ... [2025-02-06 00:05:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:05:11,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:05:11,426 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-06 00:05:11,440 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-06 00:05:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:05:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:05:11,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:05:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:05:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:05:11,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:05:11,547 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:05:11,549 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:05:11,943 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 00:05:11,943 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:05:11,963 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:05:11,963 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:05:11,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:05:11 BoogieIcfgContainer [2025-02-06 00:05:11,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:05:11,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:05:11,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:05:11,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:05:11,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:05:10" (1/3) ... [2025-02-06 00:05:11,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2165089f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:05:11, skipping insertion in model container [2025-02-06 00:05:11,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:11" (2/3) ... [2025-02-06 00:05:11,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2165089f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:05:11, skipping insertion in model container [2025-02-06 00:05:11,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:05:11" (3/3) ... [2025-02-06 00:05:11,974 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i [2025-02-06 00:05:11,987 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:05:11,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:05:12,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:05:12,052 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;@71e74a19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:05:12,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:05:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 60 states have internal predecessors, (91), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 00:05:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 00:05:12,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:12,067 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:05:12,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:12,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash -218766244, now seen corresponding path program 1 times [2025-02-06 00:05:12,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:12,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840144190] [2025-02-06 00:05:12,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:12,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 00:05:12,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 00:05:12,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:12,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-06 00:05:12,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:12,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840144190] [2025-02-06 00:05:12,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840144190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:05:12,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524230490] [2025-02-06 00:05:12,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:12,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:05:12,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:05:12,401 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-06 00:05:12,402 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-06 00:05:12,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 00:05:12,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 00:05:12,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:12,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:12,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:05:12,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:05:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-06 00:05:12,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:05:12,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524230490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:12,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:05:12,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:05:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301764577] [2025-02-06 00:05:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:12,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:05:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:12,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:05:12,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:05:12,621 INFO L87 Difference]: Start difference. First operand has 84 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 60 states have internal predecessors, (91), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 00:05:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:12,647 INFO L93 Difference]: Finished difference Result 162 states and 287 transitions. [2025-02-06 00:05:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:05:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2025-02-06 00:05:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:12,658 INFO L225 Difference]: With dead ends: 162 [2025-02-06 00:05:12,659 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 00:05:12,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-06 00:05:12,664 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:12,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:05:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 00:05:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 00:05:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 57 states have internal predecessors, (86), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 00:05:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2025-02-06 00:05:12,706 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 148 [2025-02-06 00:05:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:12,708 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2025-02-06 00:05:12,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 00:05:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2025-02-06 00:05:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 00:05:12,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:12,710 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:05:12,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 00:05:12,911 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-06 00:05:12,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:12,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:12,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1020262084, now seen corresponding path program 1 times [2025-02-06 00:05:12,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:12,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687060118] [2025-02-06 00:05:12,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:12,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:12,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 00:05:12,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 00:05:12,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:12,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:05:13,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:13,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687060118] [2025-02-06 00:05:13,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687060118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:13,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:13,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:05:13,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968106628] [2025-02-06 00:05:13,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:13,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:05:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:13,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:05:13,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:05:13,176 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:13,264 INFO L93 Difference]: Finished difference Result 231 states and 372 transitions. [2025-02-06 00:05:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:05:13,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-02-06 00:05:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:13,267 INFO L225 Difference]: With dead ends: 231 [2025-02-06 00:05:13,267 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 00:05:13,268 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-06 00:05:13,269 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 112 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:13,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 295 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:05:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 00:05:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2025-02-06 00:05:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 102 states have internal predecessors, (146), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 00:05:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 234 transitions. [2025-02-06 00:05:13,289 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 234 transitions. Word has length 148 [2025-02-06 00:05:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:13,290 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 234 transitions. [2025-02-06 00:05:13,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 234 transitions. [2025-02-06 00:05:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 00:05:13,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:13,292 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:05:13,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:05:13,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:13,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2017334437, now seen corresponding path program 1 times [2025-02-06 00:05:13,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:13,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333960588] [2025-02-06 00:05:13,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:13,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:13,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 00:05:13,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 00:05:13,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:13,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:05:13,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:13,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333960588] [2025-02-06 00:05:13,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333960588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:13,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:13,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:05:13,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352765125] [2025-02-06 00:05:13,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:13,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:05:13,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:13,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:05:13,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:05:13,458 INFO L87 Difference]: Start difference. First operand 149 states and 234 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:13,531 INFO L93 Difference]: Finished difference Result 302 states and 476 transitions. [2025-02-06 00:05:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:05:13,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-02-06 00:05:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:13,534 INFO L225 Difference]: With dead ends: 302 [2025-02-06 00:05:13,535 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 00:05:13,537 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-06 00:05:13,537 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 109 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:13,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 222 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:05:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 00:05:13,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2025-02-06 00:05:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 00:05:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 233 transitions. [2025-02-06 00:05:13,567 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 233 transitions. Word has length 148 [2025-02-06 00:05:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:13,567 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 233 transitions. [2025-02-06 00:05:13,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 233 transitions. [2025-02-06 00:05:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 00:05:13,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:13,572 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:05:13,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:05:13,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:13,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash 518634718, now seen corresponding path program 1 times [2025-02-06 00:05:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390168073] [2025-02-06 00:05:13,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:13,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:13,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 00:05:13,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 00:05:13,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:13,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:05:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:13,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390168073] [2025-02-06 00:05:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390168073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:13,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:13,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:05:13,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589720992] [2025-02-06 00:05:13,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:13,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:05:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:13,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:05:13,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:05:13,841 INFO L87 Difference]: Start difference. First operand 152 states and 233 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:13,912 INFO L93 Difference]: Finished difference Result 358 states and 551 transitions. [2025-02-06 00:05:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:05:13,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-02-06 00:05:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:13,916 INFO L225 Difference]: With dead ends: 358 [2025-02-06 00:05:13,917 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 00:05:13,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:05:13,919 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 49 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:13,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 345 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:05:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 00:05:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 198. [2025-02-06 00:05:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 128 states have (on average 1.34375) internal successors, (172), 128 states have internal predecessors, (172), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 00:05:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 304 transitions. [2025-02-06 00:05:13,958 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 304 transitions. Word has length 148 [2025-02-06 00:05:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:13,959 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 304 transitions. [2025-02-06 00:05:13,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 304 transitions. [2025-02-06 00:05:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 00:05:13,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:13,962 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:05:13,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:05:13,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:13,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash -211761722, now seen corresponding path program 1 times [2025-02-06 00:05:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:13,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472923368] [2025-02-06 00:05:13,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:13,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 00:05:14,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 00:05:14,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:14,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:05:14,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:14,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472923368] [2025-02-06 00:05:14,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472923368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:14,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:14,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:05:14,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947025688] [2025-02-06 00:05:14,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:14,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:05:14,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:14,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:05:14,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:05:14,273 INFO L87 Difference]: Start difference. First operand 198 states and 304 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:14,398 INFO L93 Difference]: Finished difference Result 500 states and 770 transitions. [2025-02-06 00:05:14,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:05:14,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-02-06 00:05:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:14,402 INFO L225 Difference]: With dead ends: 500 [2025-02-06 00:05:14,402 INFO L226 Difference]: Without dead ends: 347 [2025-02-06 00:05:14,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06 00:05:14,406 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:14,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 207 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:05:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-06 00:05:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 340. [2025-02-06 00:05:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 224 states have (on average 1.34375) internal successors, (301), 224 states have internal predecessors, (301), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-06 00:05:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 521 transitions. [2025-02-06 00:05:14,465 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 521 transitions. Word has length 149 [2025-02-06 00:05:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:14,467 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 521 transitions. [2025-02-06 00:05:14,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 521 transitions. [2025-02-06 00:05:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 00:05:14,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:14,471 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:05:14,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:05:14,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:14,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1653983383, now seen corresponding path program 1 times [2025-02-06 00:05:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559741231] [2025-02-06 00:05:14,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:14,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 00:05:14,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 00:05:14,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:14,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 00:05:14,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596770553] [2025-02-06 00:05:14,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:14,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:05:14,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:05:14,563 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-06 00:05:14,572 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-06 00:05:14,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 00:05:14,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 00:05:14,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:14,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:05:14,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:05:14,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 00:05:14,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 00:05:14,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:14,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:05:14,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:05:14,816 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:05:14,817 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:05:14,830 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-06 00:05:15,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:05:15,025 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 00:05:15,109 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:05:15,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:05:15 BoogieIcfgContainer [2025-02-06 00:05:15,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:05:15,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:05:15,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:05:15,114 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:05:15,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:05:11" (3/4) ... [2025-02-06 00:05:15,117 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:05:15,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:05:15,118 INFO L158 Benchmark]: Toolchain (without parser) took 4157.17ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 111.7MB in the beginning and 318.3MB in the end (delta: -206.5MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2025-02-06 00:05:15,120 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:05:15,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.85ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 00:05:15,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.96ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 92.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:05:15,120 INFO L158 Benchmark]: Boogie Preprocessor took 64.63ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 86.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:05:15,120 INFO L158 Benchmark]: IcfgBuilder took 576.52ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 59.6MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 00:05:15,121 INFO L158 Benchmark]: TraceAbstraction took 3146.53ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 59.2MB in the beginning and 318.3MB in the end (delta: -259.2MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2025-02-06 00:05:15,121 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 427.8MB. Free memory was 318.3MB in the beginning and 318.3MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:05:15,122 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.85ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.96ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 92.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.63ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 86.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 576.52ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 59.6MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3146.53ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 59.2MB in the beginning and 318.3MB in the end (delta: -259.2MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 427.8MB. Free memory was 318.3MB in the beginning and 318.3MB in the end (delta: 87.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 someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 165. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_8 = 32; [L25] signed long int var_1_9 = -16; [L26] unsigned short int var_1_10 = 5; [L27] unsigned char var_1_12 = 32; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 0; [L30] unsigned char var_1_15 = 0; [L31] double var_1_16 = 63.75; [L32] double var_1_17 = 8.5; [L33] signed short int var_1_18 = -64; [L34] unsigned char var_1_19 = 32; [L35] unsigned char var_1_23 = 16; [L36] signed short int var_1_24 = -1; [L37] signed short int var_1_25 = 2; [L38] unsigned char var_1_26 = 100; [L39] unsigned char var_1_29 = 128; [L40] unsigned char var_1_30 = 64; [L41] signed char var_1_31 = -1; [L42] unsigned short int var_1_32 = 100; [L43] unsigned long int var_1_33 = 0; [L44] float var_1_36 = 16.8; [L45] signed char var_1_38 = 0; [L46] signed long int var_1_39 = -4; [L47] unsigned short int var_1_40 = 256; [L48] signed long int last_1_var_1_1 = 32; [L49] unsigned char last_1_var_1_12 = 32; [L50] signed short int last_1_var_1_18 = -64; VAL [isInitial=0, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L183] last_1_var_1_1 = var_1_1 [L184] last_1_var_1_12 = var_1_12 [L185] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L148] var_1_4 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L149] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L150] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L150] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L151] var_1_9 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L152] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L153] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L153] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L154] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L154] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L155] var_1_10 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L156] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L157] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L157] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L158] var_1_13 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L159] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L160] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L160] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L161] var_1_15 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L162] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L163] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L163] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L165] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L166] var_1_23 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L168] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L168] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L169] var_1_25 = __VERIFIER_nondet_short() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L171] CALL assume_abort_if_not(var_1_25 <= 9) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L171] RET assume_abort_if_not(var_1_25 <= 9) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L172] var_1_29 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_29 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L173] RET assume_abort_if_not(var_1_29 >= 127) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L174] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L174] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L175] var_1_30 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_30 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L176] RET assume_abort_if_not(var_1_30 >= 63) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L177] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L177] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L178] var_1_36 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_36 >= -922337.2036854776000e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L179] RET assume_abort_if_not((var_1_36 >= -922337.2036854776000e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L180] CALL assume_abort_if_not(var_1_36 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L180] RET assume_abort_if_not(var_1_36 != 0.0F) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L196] RET updateVariables() [L197] CALL step() [L54] EXPR var_1_12 & var_1_1 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L54] COND TRUE (var_1_12 & var_1_1) >= var_1_8 [L55] var_1_19 = var_1_23 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L57] EXPR var_1_18 >> ((((var_1_25) < (1)) ? (var_1_25) : (1))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L57] COND TRUE ((((var_1_12) < (25)) ? (var_1_12) : (25))) > (var_1_18 >> ((((var_1_25) < (1)) ? (var_1_25) : (1)))) [L58] COND TRUE var_1_8 >= var_1_23 [L59] var_1_24 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L64] COND FALSE !(var_1_14 && var_1_14) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L67] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L72] COND FALSE !(var_1_14 && var_1_14) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L81] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L85] COND FALSE !(var_1_23 > var_1_1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L90] var_1_38 = var_1_25 [L91] var_1_39 = var_1_30 [L92] var_1_40 = var_1_30 [L93] signed long int stepLocal_1 = last_1_var_1_18; [L94] signed long int stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_1=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L95] COND FALSE !(stepLocal_1 >= (last_1_var_1_18 / var_1_9)) [L102] var_1_8 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L104] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L105] COND FALSE !(var_1_10 < var_1_18) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L116] unsigned short int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_2=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L117] COND FALSE !(stepLocal_2 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L128] COND FALSE !(var_1_18 != var_1_12) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L133] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L140] COND FALSE !(\read(var_1_14)) [L143] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return ((((((var_1_18 != var_1_12) ? (var_1_14 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) < (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18))))) ? (((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) : (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18)))))))) : 1) : 1) && ((last_1_var_1_18 >= (last_1_var_1_18 / var_1_9)) ? ((last_1_var_1_18 < (last_1_var_1_1 * 256)) ? (var_1_8 == ((unsigned short int) ((((last_1_var_1_12) < (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12))))) ? (last_1_var_1_12) : (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12)))))))) : (var_1_8 == ((unsigned short int) last_1_var_1_12))) : (var_1_8 == ((unsigned short int) last_1_var_1_12)))) && ((var_1_10 < var_1_18) ? ((last_1_var_1_12 <= (5 - last_1_var_1_12)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((last_1_var_1_12 == var_1_8) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_8 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) ? ((! (var_1_8 >= var_1_12)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_14 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 1197 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 532 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 665 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=5, InterpolantAutomatonStates: 15, 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, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1189 NumberOfCodeBlocks, 1189 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 883 ConstructedInterpolants, 0 QuantifiedInterpolants, 1364 SizeOfPredicates, 0 NumberOfNonLiveVariables, 358 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 5502/5544 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-06 00:05:15,142 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-89.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f94795b0f3f196f896b0d5b400dc38ed7472f9ce0750288d10d137d9782004a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:05:17,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:05:17,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:05:17,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:05:17,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:05:17,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:05:17,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:05:17,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:05:17,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:05:17,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:05:17,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:05:17,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:05:17,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:05:17,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:05:17,415 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:05:17,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:05:17,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:05:17,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:05:17,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:05:17,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:05:17,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:05:17,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:05:17,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:05:17,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:05:17,416 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:05:17,417 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:05:17,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:05:17,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:05:17,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:05:17,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:05:17,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:05:17,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:05:17,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:05:17,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:05:17,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:05:17,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:05:17,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:05:17,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:05:17,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:05:17,418 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:05:17,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:05:17,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:05:17,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:05:17,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:05:17,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:05:17,419 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 -> 1f94795b0f3f196f896b0d5b400dc38ed7472f9ce0750288d10d137d9782004a [2025-02-06 00:05:17,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:05:17,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:05:17,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:05:17,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:05:17,717 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:05:17,718 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-89.i [2025-02-06 00:05:19,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c0a22aa3/d00096f5480b4873811ccff11032f98b/FLAG70e24a29c [2025-02-06 00:05:19,354 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:05:19,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i [2025-02-06 00:05:19,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c0a22aa3/d00096f5480b4873811ccff11032f98b/FLAG70e24a29c [2025-02-06 00:05:19,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c0a22aa3/d00096f5480b4873811ccff11032f98b [2025-02-06 00:05:19,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:05:19,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:05:19,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:05:19,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:05:19,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:05:19,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5353608b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19, skipping insertion in model container [2025-02-06 00:05:19,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:05:19,536 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-89.i[919,932] [2025-02-06 00:05:19,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:05:19,633 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:05:19,642 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-89.i[919,932] [2025-02-06 00:05:19,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:05:19,699 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:05:19,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19 WrapperNode [2025-02-06 00:05:19,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:05:19,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:05:19,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:05:19,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:05:19,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,748 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-02-06 00:05:19,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:05:19,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:05:19,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:05:19,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:05:19,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,787 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-06 00:05:19,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:05:19,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:05:19,809 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:05:19,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:05:19,810 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (1/1) ... [2025-02-06 00:05:19,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:05:19,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:05:19,847 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-06 00:05:19,857 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-06 00:05:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:05:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:05:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:05:19,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:05:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:05:19,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:05:19,982 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:05:19,984 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:05:29,429 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 00:05:29,429 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:05:29,441 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:05:29,441 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:05:29,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:05:29 BoogieIcfgContainer [2025-02-06 00:05:29,441 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:05:29,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:05:29,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:05:29,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:05:29,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:05:19" (1/3) ... [2025-02-06 00:05:29,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770df0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:05:29, skipping insertion in model container [2025-02-06 00:05:29,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:19" (2/3) ... [2025-02-06 00:05:29,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770df0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:05:29, skipping insertion in model container [2025-02-06 00:05:29,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:05:29" (3/3) ... [2025-02-06 00:05:29,453 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i [2025-02-06 00:05:29,468 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:05:29,469 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:05:29,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:05:29,530 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;@5ea25ce4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:05:29,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:05:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 00:05:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 00:05:29,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:29,545 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:05:29,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:29,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1938607715, now seen corresponding path program 1 times [2025-02-06 00:05:29,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:05:29,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359314319] [2025-02-06 00:05:29,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:29,562 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-06 00:05:29,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:05:29,572 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-06 00:05:29,580 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-06 00:05:29,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 00:05:29,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 00:05:29,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:29,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:29,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:05:29,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:05:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-06 00:05:29,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:05:29,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:05:29,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359314319] [2025-02-06 00:05:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359314319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:29,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:29,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:05:29,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328594326] [2025-02-06 00:05:29,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:29,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:05:29,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:05:29,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:05:29,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:05:29,974 INFO L87 Difference]: Start difference. First operand has 79 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 00:05:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:30,012 INFO L93 Difference]: Finished difference Result 152 states and 271 transitions. [2025-02-06 00:05:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:05:30,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2025-02-06 00:05:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:30,022 INFO L225 Difference]: With dead ends: 152 [2025-02-06 00:05:30,022 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 00:05:30,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-06 00:05:30,032 INFO L435 NwaCegarLoop]: 122 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, 122 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-06 00:05:30,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:05:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 00:05:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 00:05:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.5) internal successors, (78), 52 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 00:05:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2025-02-06 00:05:30,094 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 122 transitions. Word has length 146 [2025-02-06 00:05:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:30,094 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 122 transitions. [2025-02-06 00:05:30,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 00:05:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 122 transitions. [2025-02-06 00:05:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 00:05:30,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:30,105 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:05:30,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-06 00:05:30,305 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-06 00:05:30,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1957760637, now seen corresponding path program 1 times [2025-02-06 00:05:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:05:30,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833830353] [2025-02-06 00:05:30,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:30,312 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-06 00:05:30,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:05:30,314 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-06 00:05:30,315 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-06 00:05:30,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 00:05:30,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 00:05:30,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:30,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:30,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 00:05:30,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:05:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:05:39,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:05:39,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:05:39,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833830353] [2025-02-06 00:05:39,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833830353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:39,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:39,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:05:39,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143146724] [2025-02-06 00:05:39,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:39,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:05:39,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:05:39,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:05:39,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:05:39,670 INFO L87 Difference]: Start difference. First operand 76 states and 122 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:44,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:05:46,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:05:46,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:46,896 INFO L93 Difference]: Finished difference Result 203 states and 330 transitions. [2025-02-06 00:05:46,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:05:46,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-02-06 00:05:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:46,982 INFO L225 Difference]: With dead ends: 203 [2025-02-06 00:05:46,982 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 00:05:46,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 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-06 00:05:46,983 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 25 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:46,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 199 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2025-02-06 00:05:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 00:05:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2025-02-06 00:05:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 69 states have internal predecessors, (95), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 00:05:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 183 transitions. [2025-02-06 00:05:47,006 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 183 transitions. Word has length 146 [2025-02-06 00:05:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:47,006 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 183 transitions. [2025-02-06 00:05:47,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 183 transitions. [2025-02-06 00:05:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 00:05:47,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:47,009 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:05:47,018 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-06 00:05:47,209 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-06 00:05:47,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:47,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1928382434, now seen corresponding path program 1 times [2025-02-06 00:05:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:05:47,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111111665] [2025-02-06 00:05:47,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:47,211 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-06 00:05:47,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:05:47,213 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-06 00:05:47,214 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-06 00:05:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 00:05:47,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 00:05:47,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:47,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:47,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 00:05:47,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:05:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:05:52,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:05:52,476 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:05:52,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111111665] [2025-02-06 00:05:52,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111111665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:52,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:52,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:05:52,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969073081] [2025-02-06 00:05:52,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:52,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:05:52,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:05:52,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:05:52,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:05:52,477 INFO L87 Difference]: Start difference. First operand 116 states and 183 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:05:56,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:06:01,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:06:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:06:01,459 INFO L93 Difference]: Finished difference Result 204 states and 330 transitions. [2025-02-06 00:06:01,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:06:01,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-02-06 00:06:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:06:01,555 INFO L225 Difference]: With dead ends: 204 [2025-02-06 00:06:01,555 INFO L226 Difference]: Without dead ends: 131 [2025-02-06 00:06:01,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 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-06 00:06:01,556 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 26 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:06:01,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 208 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2025-02-06 00:06:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-06 00:06:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 117. [2025-02-06 00:06:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 00:06:01,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 184 transitions. [2025-02-06 00:06:01,584 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 184 transitions. Word has length 146 [2025-02-06 00:06:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:06:01,585 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 184 transitions. [2025-02-06 00:06:01,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:06:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 184 transitions. [2025-02-06 00:06:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 00:06:01,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:06:01,590 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:06:01,601 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-06 00:06:01,791 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-06 00:06:01,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:06:01,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:06:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash 162381698, now seen corresponding path program 1 times [2025-02-06 00:06:01,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:06:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876814530] [2025-02-06 00:06:01,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:06:01,794 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-06 00:06:01,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:06:01,796 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-06 00:06:01,797 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-06 00:06:01,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 00:06:02,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 00:06:02,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:06:02,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:06:02,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 00:06:02,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:06:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:06:05,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:06:05,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:06:05,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876814530] [2025-02-06 00:06:05,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876814530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:06:05,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:06:05,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:06:05,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156623209] [2025-02-06 00:06:05,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:06:05,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:06:05,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:06:05,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:06:05,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:06:05,118 INFO L87 Difference]: Start difference. First operand 117 states and 184 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:06:05,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:06:05,659 INFO L93 Difference]: Finished difference Result 257 states and 410 transitions. [2025-02-06 00:06:05,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:06:05,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-02-06 00:06:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:06:05,662 INFO L225 Difference]: With dead ends: 257 [2025-02-06 00:06:05,662 INFO L226 Difference]: Without dead ends: 184 [2025-02-06 00:06:05,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 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-06 00:06:05,664 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 38 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:06:05,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 211 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 00:06:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-06 00:06:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2025-02-06 00:06:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 110 states have internal predecessors, (147), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 00:06:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2025-02-06 00:06:05,688 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 147 [2025-02-06 00:06:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:06:05,688 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2025-02-06 00:06:05,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:06:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2025-02-06 00:06:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 00:06:05,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:06:05,690 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:06:05,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 00:06:05,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 00:06:05,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:06:05,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:06:05,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1701278500, now seen corresponding path program 1 times [2025-02-06 00:06:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:06:05,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675624810] [2025-02-06 00:06:05,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:06:05,892 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-06 00:06:05,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:06:05,894 INFO L229 MonitoredProcess]: Starting monitored process 6 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-06 00:06:05,896 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 (6)] Waiting until timeout for monitored process [2025-02-06 00:06:05,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 00:06:06,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 00:06:06,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:06:06,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:06:06,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 00:06:06,188 INFO L279 TraceCheckSpWp]: Computing forward predicates...